Every eigenvalue of a Hamming ball subgraph equals 2x minus (n minus 2t) for a root x of a Krawtchouk polynomial, with explicit eigenspaces; this yields the maximal eigenvalue as n minus 2 times the first root of K_{r+1}^{(n)} and extends spectral extremality of Hamming balls to subconstant…
A modified logarithmic Sobolev inequality for the Hamming cube and some applications
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The logarithmic Sobolev inequality for the Hamming cube {0,1}^n states that for any real-valued function f on the cube holds E(f,f) \ge 2 Ent(f^2), where E(f,f) is the appropriate Dirichlet form (also known as "sum of influences"). We show that the constant C = 2 at the right hand side of this inequality can be replaced by a function C(rho) depending on rho = Ent(f^2) / (n Ef^2). The function C is an increasing convex function taking [0,log 2] to [2, 2/log 2]. We present some applications of this modified inequality. In particular, it is used to obtain a discrete version of the Faber-Krahn inequality for small subsets of the Hamming cube, answering a question of Friedman and Tillich. We introduce, following the approach of Friedman and Tillich, the notion of a fractional edge-boundary size of a subset of {0,1}^n, and show Hamming balls of radius at most n/2 - O(n^{3/4}) to be sets with (asymptotically) the smallest fractional edge-boundary for their size.
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Eigenvalues and eigenfunctions of a Hamming ball
Every eigenvalue of a Hamming ball subgraph equals 2x minus (n minus 2t) for a root x of a Krawtchouk polynomial, with explicit eigenspaces; this yields the maximal eigenvalue as n minus 2 times the first root of K_{r+1}^{(n)} and extends spectral extremality of Hamming balls to subconstant…