English
Related papers

Related papers: Local $h^*$-polynomials for one-row Hermite normal…

200 papers

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…

A generic orthotope is an orthogonal polytope whose tangent cones are described by read-once Boolean functions. The purpose of this note is to develop a theory ofEhrhart polynomials for integral generic orthotopes. The most remarkable part…

Combinatorics · Mathematics 2023-09-19 David Richter

We consider the Ehrhart $h^*$-vector for the hypersimplex. It is well-known that the sum of the $h_i^*$ is the normalized volume which equals an Eulerian numbers. The main result is a proof of a conjecture by R. Stanley which gives an…

Combinatorics · Mathematics 2012-08-10 Nan Li

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…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…

Combinatorics · Mathematics 2024-11-12 Ginji Hamano , Ichiro Sainose , Takayuki Hibi

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…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

The main aim of this paper is the study of the general solution of the exceptional Hermite differential equation with fixed partition $\lambda = (1)$ and the construction of minimal surfaces associated with this solution. We derive a linear…

Mathematical Physics · Physics 2020-10-28 Vincent Chalifour , A. Michel Grundland

The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…

Combinatorics · Mathematics 2025-10-16 Abdulrahman Alajmi , Sayok Chakravarty , Zachary Kaplan , Jenya Soprunova

Lattice polytopes are called IDP polytopes if they have the integer decomposition property, i.e., any lattice point in a $k$th dilation is a sum of $k$ lattice points in the polytope. It is a long-standing conjecture whether the numerator…

Combinatorics · Mathematics 2025-05-27 Johannes Hofscheier , Vadym Kurylenko , Benjamin Nill

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…

Combinatorics · Mathematics 2017-10-26 Kolja Knauer , Leonardo Martínez-Sandoval , Jorge Luis Ramírez Alfonsín

We prove the existence of exponentially localised and time-periodic solutions in general nonlinear Hamiltonian lattice systems. Like normal modes, these localised solutions are characterised by collective oscillations at the lattice sites…

Pattern Formation and Solitons · Physics 2016-07-14 Dirk Hennig

The Ehrhart polynomial $\text{ehr}_P(n)$ of a lattice polytope $P$ counts the number of integer points in the $n$-th integral dilate of $P$. The $f^*$-vector of $P$, introduced by Felix Breuer in 2012, is the vector of coefficients of…

Combinatorics · Mathematics 2024-09-24 Matthias Beck , Danai Deligeorgaki , Max Hlavacek , Jerónimo Valencia-Porras

We study the extended root polytope associated to a directed graph. We show that under the operations of deletion and contraction of an edge of the graph, none of the coefficients of the $h^*$-polynomial of the associated extended root…

Combinatorics · Mathematics 2025-01-10 Tamás Kálmán , Lilla Tóthmérész

Many homogeneous polynomials that arise in the study of sums of squares and Hilbert's 17th problem come from monomial substitutions into the arithmetic-geometric inequality. In 1989, the second author gave a necessary and sufficient…

Combinatorics · Mathematics 2019-09-25 Victoria Powers , Bruce Reznick

We show that: (1) unimodular simplices in a lattice 3-polytope cover a neighborhood of the boundary of the polytope if and only if the polytope is very ample, (2) the convex hull of lattice points in every ellipsoid in R^3 has a unimodular…

Combinatorics · Mathematics 2021-10-01 Joseph Gubeladze

A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…

Combinatorics · Mathematics 2019-10-25 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

In this paper, we will prove that given a lattice simplex with its $h^*$-polynomial $\sum_{i \geq 0}h_i^*t^i$, if $h_{k+1}^*=\cdots=h_{2k}^*=0$ holds, then there exists a lattice simplex of degree $k$ whose $h^*$-polynomial coincides with…

Combinatorics · Mathematics 2018-12-27 Akihiro Higashitani

The coefficients of the local $h$-polynomial of the barycentric subdivision of the simplex with $n$ vertices are known to count derangements in the symmetric group $\mathfrak{S}_n$ by the number of excedances. A generalization of this…

Combinatorics · Mathematics 2014-10-10 Christos A. Athanasiadis

In Ehrhart theory, the $h^*$-vector of a rational polytope often provide insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic…

Combinatorics · Mathematics 2015-04-28 Robert Davis

Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…

Statistics Theory · Mathematics 2010-12-06 Luigi Malagò , Giovanni Pistone