中文
相关论文

相关论文: Lattice polytopes having h^*-polynomials with give…

200 篇论文

Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…

组合数学 · 数学 2026-05-21 Takashi Hirotsu

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

组合数学 · 数学 2018-06-04 Benjamin Braun , Robert Davis , Liam Solus

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

组合数学 · 数学 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

组合数学 · 数学 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

We show that the linear coefficient of the Ehrhart polynomial of a matroid base polytope evaluated at $t-1$ is equal to, up to normalization, the $\beta$-invariant of the matroid. This yields a lattice-point counting formula for the…

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…

M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…

组合数学 · 数学 2010-07-23 Benjamin Braun

We study semigroup algebras arising from lattice polytopes, compute their volume polynomials (particularizing work of Hochster), and establish strong Lefschetz properties (generalizing work of the first three authors). This resolves several…

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…

组合数学 · 数学 2020-02-11 Johannes Hofscheier , Benjamin Nill , Dennis Öberg

The local $h^*$-polynomial of a lattice polytope is an important invariant arising in Ehrhart theory. Our focus is on lattice simplices presented in Hermite normal form with a single non-trivial row. We prove that when the off-diagonal…

The local $h^*$-polynomial is a natural invariant of a lattice polytope appearing in Ehrhart theory and Hodge theory. In this work, we study the question posed in [GKZ94] concerning the classification of lattice simplices with vanishing…

组合数学 · 数学 2025-12-23 Vadym Kurylenko

In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…

组合数学 · 数学 2016-01-20 Sandra Di Rocco , Christian Haase , Benjamin Nill , Andreas Paffenholz

A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…

组合数学 · 数学 2018-05-07 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

组合数学 · 数学 2009-09-24 Alan Stapledon

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

数论 · 数学 2016-03-18 Eugen J. Ionascu

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

组合数学 · 数学 2016-12-30 Gabriele Balletti , Alexander M. Kasprzyk

There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…

组合数学 · 数学 2020-01-14 Liam Solus

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

组合数学 · 数学 2007-05-23 Oleg Pikhurko

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

组合数学 · 数学 2018-02-21 Akihiro Higashitani , Mikiya Masuda

In this paper we study the novel notion of thin polytopes: lattice polytopes whose local $h^*$-polynomials vanish. The local $h^*$-polynomial is an important invariant in modern Ehrhart theory. Its definition goes back to Stanley with…

组合数学 · 数学 2023-09-14 Christopher Borger , Andreas Kretschmer , Benjamin Nill