The path-graph variational constant conjecture
Statement
Let be the path graph on vertices, and let denote its optimal -variational constant, namely the smallest constant such that
for every real-valued function on .
Path-graph conjecture. For every integer ,
The source reports numerical evidence for all . The conjecture would imply the bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.