ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P⊂Rn{\mathcal P} \subset {\mathbb R}^n be a normal polytope of dimension nn with (P∖∂P)∩Zn≠∅({\mathcal P} \setminus \partial {\mathcal P}) \cap {\mathbb Z}^n \neq \emptyset. For a∈N(P∖∂P)∩Zn{\mathbf a} \in N({\mathcal P} \setminus \partial {\mathcal P}) \cap {\mathbb Z}^n, its reduced P{\mathcal P}-degree is the smallest integer r≥1r \geq 1 for which there are a0∈r(P∖∂P)∩Zn{\mathbf a}_0 \in r({\mathcal P} \setminus \partial {\mathcal P}) \cap {\mathbb Z}^n and a′∈(N−r)P∩Zn{\mathbf a}' \in (N-r){\mathcal P} \cap {\mathbb Z}^n such that a=a0+a′{\mathbf a}={\mathbf a}_0+{\mathbf a}'. The int degree assertion.* If the int* degree of P{\mathcal P} is dd, then for each 1≤i<d1 \leq i < d, there is a∈N(P∖∂P)∩Zn{\mathbf a} \in N({\mathcal P} \setminus \partial {\mathcal P}) \cap {\mathbb Z}^n whose reduced P{\mathcal P}-degree is ii. The reduced P{\mathcal P}-degree is known to be at most n−1n-1, while the int* degree records the biggest such degree; the assertion asks whether every intermediate degree occurs whenever the maximum is dd.

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.