Skip to content
Level B · Reproducible Analysis P-constant-11a-the-l-1-poincare-constant-on-the-hamming-cube

The L^1 Poincaré constant on the Hamming cube

C_11a is the smallest constant such that, for every n≥ 1 and every function f:-1,1^n → ℝ Ebigl|f(x)-Ef(x)bigr| ≤ C_11aE|∇ f|(x), where x=(x_1,…,x_n) is uniform on -1,1^n and |∇ f|(x)=Bigl(Σ_j=1^n |D_j f(x)|^2Bigr)^1/2, D_j f(x)=f(x)-f(x^(j))/2, with x^(j)=(x_1,...,x_j-1,-x_j,x_j+1,...,x_n).

Current state (tracked automatically)

  • Best known bounds for constant 11a: 1.25331 ≤ C ≤ 0.00013. Upper bound ([IS2024], Provides an explicit integral expression for and evaluates it numerically (about 1.3 10^-4)); lower bound ([Pisier1986], [ILvHV2019], Comes from the sharp Gaussian L^1-Poincaré inequality (Pisier)).
All tracked facts and sources
FactValueSource
Best lower bound with an explicit value (constant 11a)1.25331
[Pisier1986], [ILvHV2019] — Comes from the sharp Gaussian L^1-Poincaré inequality (Pisier).
Tao's optimization constants
Best upper bound with an explicit value (constant 11a)0.00013
[IS2024] — Provides an explicit integral expression for and evaluates it numerically (about 1.3 10^-4).
Tao's optimization constants

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Tao's optimization constants (checked 2026-11-12). How it works.

From the catalogue. Imported from Terence Tao and contributors (optimizationproblems repository) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Try it with your chatbot Submit a claim Follow (RSS)
Cite
@misc{cairn-constant-11a-the-l-1-poincare-constant-on-the-hamming-cube,
  title        = {The L^1 Poincaré constant on the Hamming cube},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/constant-11a-the-l-1-poincare-constant-on-the-hamming-cube}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fconstant-11a-the-l-1-poincare-constant-on-the-hamming-cube.json)](https://cairn-commons.com/problems/constant-11a-the-l-1-poincare-constant-on-the-hamming-cube)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

Description of constant

is the smallest constant such that, for every and every function :{-1,1}^n

where is uniform on {-1,1}^n and

with

This is sometimes described as the (dimension-free) Cheeger constant appearing in the Poincaré inequality on the discrete cube.

Known upper bounds

BoundReferenceComments
[BELP2008]First proof (non-commutative/CAR algebra). Several later proofs recover the same constant.
for some [ILvHV2019]First proof that is strictly smaller than .
with [IS2024]Provides an explicit integral expression for and evaluates it numerically (about ).

Known lower bounds

BoundReferenceComments
TrivialFor , take to get ratio .
[Pisier1986], [ILvHV2019]Comes from the sharp Gaussian -Poincaré inequality (Pisier).

Additional comments and links

References

  • [BELP2008] Ben Efraim, L.; Lust-Piquard, F. Poincaré type inequalities on the discrete cube and in the CAR algebra. Probab. Theory Related Fields 141 (2008), no. 3–4, 569–602.
  • [ILvHV2019] Ivanisvili, P.; Li, D.; van Handel, R.; Volberg, A. Improving constant in end-point Poincaré inequality on Hamming cube. arXiv:1811.05584 (2018/2019).
  • [IS2024] Ivanisvili, P.; Stone, Y. Sharpening the gap between and norms. arXiv:2407.04835 (2024).
  • [Pisier1986] Pisier, G. Probabilistic methods in the geometry of Banach spaces. In: Probability and Analysis (Varenna, 1985), Lecture Notes in Math. 1206, Springer, Berlin (1986).

What counts as progress

  • A better upper or lower bound, with a proof or a construction whose value is re-computed by published code (reproducible), ideally with a certificate a deterministic checker can validate.
  • A formal proof (Lean) of a known bound, or a precise error in a claimed one.
  • New references for the tables above (literature claims).

Source and licence

Imported from the crowdsourced repository of optimization constants (Terence Tao and contributors), commit 87b4ebbd426f, Apache License 2.0; reformatted for this page. New records should also be reported there.