English
Related papers

Related papers: Lattice polytopes having h^*-polynomials with give…

200 papers

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

Let a polyhedron $P$ be defined by one of the following ways: (i) $P = \{x \in R^n \colon A x \leq b\}$, where $A \in Z^{(n+k) \times n}$, $b \in Z^{(n+k)}$ and $rank\, A = n$; (ii) $P = \{x \in R_+^n \colon A x = b\}$, where $A \in Z^{k…

Computational Complexity · Computer Science 2022-11-30 D. V. Gribanov , N. Yu. Zolotykh

We give two new constructions of the harmonic algebra of a lattice polytope $P$, a bigraded algebra whose character is the $q$-Ehrhart series of $P$ defined by Reiner and Rhoades. First, we show that the harmonic algebra is the associated…

Combinatorics · Mathematics 2025-08-27 Ian Cavey

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

Combinatorics · Mathematics 2026-04-13 Feihu Liu

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

Combinatorics · Mathematics 2025-08-14 Luis Ferroni , Alex Fink

A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…

Combinatorics · Mathematics 2008-09-11 Jaron Treutlein

We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…

Combinatorics · Mathematics 2017-06-20 Nicholas Proudfoot , Ben Young , Yuan Xu

We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…

Combinatorics · Mathematics 2024-12-02 Girtrude Hamm , Johannes Hofscheier , Alexander Kasprzyk

We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…

Combinatorics · Mathematics 2023-02-15 Oliver Clarke , Akihiro Higashitani , Max Kölbl

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

Combinatorics · Mathematics 2016-04-05 Amanda Cameron , Alex Fink

In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…

Combinatorics · Mathematics 2025-06-23 Gianira N. Alfarano , Eimear Byrne

The lattice size $\operatorname{ls_\Delta}(P)$ of a lattice polytope $P$ is a geometric invariant, which was formally introduced in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an…

Combinatorics · Mathematics 2024-05-22 Abdulrahman Alajmi , Jenya Soprunova

Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified. In this paper we study the arity gap of…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen

In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins , Alexander Postnikov

The Kodaira dimension of a nondegenerate toric hypersurface can be computed from the dimension of the Fine interior of its Newton polytope according to recent work of Victor Batyrev, where the Fine interior of the Newton polytope is the…

Algebraic Geometry · Mathematics 2025-07-04 Martin Bohnert

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

Combinatorics · Mathematics 2023-07-12 Alessio D'Alì , Martina Juhnke-Kubitzke , Melissa Koch

We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…

Combinatorics · Mathematics 2021-07-05 Federico Ardila , Laura Escobar

In this paper, we study nearly Gorensteinness of Ehrhart rings arising from lattice polytopes. We give necessary conditions and sufficient conditions on lattice polytopes for their Ehrhart rings to be nearly Gorenstein. Using this, we give…

Combinatorics · Mathematics 2023-03-24 Thomas Hall , Max Kölbl , Koji Matsushita , Sora Miyashita

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

Exactly Solvable and Integrable Systems · Physics 2017-02-28 Dinh T Tran , John A G Roberts