ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XΩX_\Omega be a convex toric domain with weight sequence (c;a1,…,as;b1,…,bt)(c;a_1,\dots,a_s;b_1,\dots,b_t), and let λ\lambda be the Ω\Omega-perimeter. A convex toric domain is tightly constrained when its capacity function is eventually strictly increasing, equivalently when every sufficiently large positive integer occurs among its ECH capacities. Let YΣ(Ω)Y_{\Sigma(\Omega)} be the toric variety associated to Ω\Omega, and let DΩD_\Omega be its balance divisor.

Weight-gcd conjecture. If

gcd⁡{c,a1,…,as,b1,…,bt}=1,\operatorname{gcd}\{c,a_1,\dots,a_s,b_1,\dots,b_t\}=1,

then Ω\Omega is tightly constrained.

This conjecture would characterize tight constraint by a simple arithmetic condition on the weight sequence. The paper notes that tight constraint is known when at least one weight equals 11; the general equivalence with the gcd condition remains open.

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.