Families of lattice polytopes of mixed degree one
From MaRDI portal
Publication:2306001
DOI10.1016/j.jcta.2020.105229zbMath1439.52012arXiv1904.01343OpenAlexW2927622555MaRDI QIDQ2306001
Christopher Borger, Gabriele Balletti
Publication date: 20 March 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.01343
Related Items
Classification of triples of lattice polytopes with a given mixed volume ⋮ On the classification of duality webs for graded quivers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Mixed discriminants
- Systems of equations with a single solution
- Global residues for sparse polynomial systems
- Triangulations. Structures for algorithms and applications
- Classification of reflexive polyhedra in three dimensions
- The Magma algebra system. I: The user language
- Universal inequalities in Ehrhart theory
- The mixed degree of families of lattice polytopes
- Classifying smooth lattice polytopes via toric fibrations
- Polyhedral adjunction theory
- Reflexive polytopes arising from partially ordered sets and perfect graphs
- Projecting Lattice Polytopes Without Interior Lattice Points
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
- A combinatorial description of dual defects of toric varieties
- Computing the Continuous Discretely
- Convex Bodies The Brunn-MinkowskiTheory
