Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees (Q1974784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1425083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees |
scientific article; zbMATH DE number 1425083 |
Statements
Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees (English)
0 references
27 March 2000
0 references
Contents of the paper: (1) Introduction. (2) A general setting for convolution-rearrangement inequalities on discrete metric spaces. (3) The general case of a graph. (4) The octahedron. (5) The discrete circle graphs \(\mathbb{Z}_n\). (6) The regular trees. (7) Complete graphs, inequalities on the edges of \(T_p\), and line graphs. (8) Some more open problems and two counterexamples. (9) The Faber-Krahn inequality in Friedman's setting [see \textit{J. Friedman}, Duke Math. J. 69, No. 3, 487-525 (1993; Zbl 0785.05066)].
0 references
convolution-rearrangement inequalities
0 references
discrete metric spaces
0 references
octahedron
0 references
circle graphs
0 references
regular trees
0 references
line graphs
0 references
Faber-Krahn inequality
0 references
0 references
0.7880062460899353
0 references
0.7787191271781921
0 references
0.7499603033065796
0 references
0.7499603033065796
0 references
