ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be a cycle, let XX be an optimal function on CnC_n, and let dd denote graph distance. Then XX is an optimal function in the subgaussian sense described in the source.

Bobkov–Houdré–Tetali conjecture. There exists a vertex x0∈V(Cn)x_0\in V(C_n) such that, for every v∈V(Cn)v\in V(C_n),

∣X(v)−X(v0)∣=d(x0,v).|X(v)-X(v_0)|=d(x_0,v).

Bobkov, Houdré, and Tetali proposed this characterization for optimal functions on odd cycles, and Sammer and Tetali repeated it. The supplied text does not state whether the conjecture has been resolved.

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.