ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k≥1k\geq1, let Δk(ε)\Delta_k(\varepsilon) denote the function studied in the paper, with 0≤ε≤10\leq\varepsilon\leq1. Delta three and Delta four polygonal conjecture. The graph of Δ3(ε)\Delta_3(\varepsilon) is the polygonal path connecting

(0,0),(47,27),(711,411),(57,37),(1,1),(0,0),\left(\frac47,\frac27\right),\left(\frac7{11},\frac4{11}\right),\left(\frac57,\frac37\right),(1,1),

and the graph of Δ4(ε)\Delta_4(\varepsilon) is the polygonal path connecting

(0,0),(512,16),(919,419),(12,29),(23,1027),(1724,512),(1,1).(0,0),\left(\frac5{12},\frac16\right),\left(\frac9{19},\frac4{19}\right),\left(\frac12,\frac29\right),\left(\frac23,\frac{10}{27}\right),\left(\frac{17}{24},\frac5{12}\right),(1,1).

The authors report computational evidence that these are upper bounds for the corresponding graphs, but have not verified that the bounds are sharp.

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.