2000 character limit reached
On lattice path matroid polytopes: integer points and Ehrhart polynomial (1701.05529v2)
Published 19 Jan 2017 in math.CO
Abstract: In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove that lattice path matroid polytopes are affinely equivalent to a family of distributive polytopes. As applications we obtain two new infinite families of matroids verifying a conjecture of De Loera et.~al. and present an explicit formula of the Ehrhart polynomial for one of them.
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.