2000 character limit reached
Gorenstein properties and integer decomposition properties of lecture hall polytopes (1608.03934v2)
Published 13 Aug 2016 in math.CO
Abstract: Though much is known about ${\bf s}$-lecture hall polytopes, there are still many unanswered questions. In this paper, we show that ${\bf s}$-lecture hall polytopes satisfy the integer decomposition property (IDP) in the case of monotonic ${\bf s}$-sequences. Given restrictions on a monotonic ${\bf s}$-sequence, we discuss necessary and sufficient conditions for the Fano, reflexive and Gorenstein properties. Additionally, we give a construction for producing Gorenstein/IDP lecture hall polytopes.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.