Intermediate reduced degrees for the int* degree of a polytope
Statement
Let be a normal polytope of dimension with . For , its reduced -degree is the smallest integer for which there are and such that . The int degree assertion.* If the int* degree of is , then for each , there is whose reduced -degree is . The reduced -degree is known to be at most , while the int* degree records the biggest such degree; the assertion asks whether every intermediate degree occurs whenever the maximum is .
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.