The Ehrhart quasipolynomial of a rational polytope P encodes fundamental arithmetic data of P, namely, the number of integer lattice points in positive integral dilates of P. Ehrhart quasipolynomials were introduced in the 1960s, satisfy several fundamental structural results and have applications in many areas of mathematics and beyond. The enumerative theory of lattice points in rational (equivalently, real) dilates of rational polytopes is much younger, starting with work by Linke (2011), Baldoni-Berline-Koeppe-Vergne (2013), and Stapledon (2017). We introduce a generating-function ansatz for rational Ehrhart quasipolynomials, which unifies several known results in classical and rational Ehrhart theory. In particular, we define γ-rational Gorenstein polytopes, which extend the classical notion to the rational setting and encompass the generalized reflexive polytopes studied by Fiset-Kasprzyk (2008) and Kasprzyk-Nill (2012).
A catalogue of simplicial hyperplane arrangements was first given by Grünbaum in 1971. These arrangements naturally generalize finite Coxeter arrangements and also the weak order through the poset of regions. The weak order is known to be a congruence normal lattice, and congruence normality of lattices of regions of simplicial arrangements can be determined using polyhedral cones called shards. In this article, we update Grünbaum’s catalogue by providing normals realizing all known simplicial arrangements with up to 37 lines and key invariants. Then we add structure to this catalogue by determining which arrangements always/sometimes/never lead to congruence normal lattices of regions. To this end, we use oriented matroids to recast shards as covectors to determine congruence normality of large hyperplane arrangements. We also show that lattices of regions coming from finite Weyl groupoids of any rank are always congruence normal.
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including zonotopal decompositions, symmetric triangulations, combinatorial interpretation of the h * -polynomial, and certificates for the (non)existence of invariant non-degenerate hypersurfaces. We apply these methods to several families of examples including hypersimplices, orbit polytopes, and graphic zonotopes, expanding the library of polytopes for which their equivariant Ehrhart theory is known.
A. A catalogue of simplicial hyperplane arrangements was first given by Gr ünbaum in 1971. These arrangements naturally generalize finite Coxeter arrangements and also the weak order through the poset of regions. The weak order is known to be a congruence normal lattice, and congruence normality of lattices of regions of simplicial arrangements can be determined using polyhedral cones called shards.In this article, we update Gr ünbaum's catalogue by providing normals realizing all known simplicial arrangements with up to 37 lines and key invariants. Then, we add structure to this catalogue by determining which arrangements always/sometimes/never lead to congruence normal lattices of regions. To this end, we use oriented matroids to recast shards as covectors to determine congruence normality of large hyperplane arrangements. We also show that lattices of regions coming from finite Weyl groupoids of any rank are always congruence normal.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.