Pith. sign in

REVIEW 1 cited by

A modified logarithmic Sobolev inequality for the Hamming cube and some applications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0807.1679 v1 pith:2KBKVDVE submitted 2008-07-10 math.CO

classification math.CO
keywords inequalitycubefunctionhammingapplicationsedge-boundaryfractionalfriedman
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Eigenvalues and eigenfunctions of a Hamming ball

    math.CO 2024-11 conditional novelty 8.0 of 10

    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...

Pith tools