Papers
Topics
Authors
Recent
Search
2000 character limit reached

Gorenstein properties and integer decomposition properties of lecture hall polytopes

Published 13 Aug 2016 in math.CO | (1608.03934v2)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.