ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path graph on nn vertices, and let CPn\mathbf{C}_{P_n} denote its optimal 11-variational constant, namely the smallest constant such that

VarMPnf⩽CPnVarf\textup{Var} M_{P_n}f\leqslant \mathbf{C}_{P_n}\textup{Var} f

for every real-valued function ff on PnP_n.

Path-graph conjecture. For every integer n⩾3n\geqslant3,

CPn=1−1n.\mathbf{C}_{P_n}=1-\frac1n.

The source reports numerical evidence for all n⩽10n\leqslant10. The conjecture would imply the bound CZ⩽1\mathbf{C}_{\mathbb{Z}}\leqslant1 for the integer lattice, and hence the corresponding real-line bound, but it remains open and is expected to be difficult.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.