ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α=(α1,α2)\alpha=(\alpha_1,\alpha_2) with gcd⁡(α1,α2)=1\gcd(\alpha_1,\alpha_2)=1 and suppose α1≥α2\alpha_1\geq\alpha_2. Let InI_n be the ideals in the chain of non-Laurent toric ideals induced by the monomial yα{\bf y}^{\alpha}. Degree-complexity conjecture. The degree-complexity of InI_n is of the form 2α1−α22\alpha_1-\alpha_2 for all but possibly finitely many ideals InI_n in the chain. The conjecture is based on computational observations and is presented in the paper's section on open problems and conjectures; no proof or resolution is supplied.

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.