Dickenstein–Nill codegree conjecture for lattice polytopes
Statement
Let be an -dimensional lattice polytope, and let denote its codegree. A Cayley sum is a polytope obtained by assembling polytopes along the vertices of a simplex; a nontrivial Cayley structure has more than one summand.
Dickenstein–Nill conjecture. If
then decomposes as a Cayley sum of lattice polytopes of dimension at most
This is the integral-toric counterpart of the Beltrametti–Sommese fibration conjecture. The source states that it remains open in its original generality, although it is proved for Gorenstein polytopes and under additional hypotheses.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.