English
Related papers

Related papers: Lattice multi-polygons

200 papers

We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…

Combinatorics · Mathematics 2023-03-31 Wayne A. Johnson

In this note, we given a version of Pick's theorem for the simple lattice polygon in two-dimensional subspace of R^3.

Metric Geometry · Mathematics 2021-12-01 Lin Si

A half-integral polygon with quasi-period collapse behaves similarly to a lattice polygon in the sense that the number of lattice points in its integer dilates can be calculated as values of a polynomial, its Ehrhart polynomial. As a main…

Combinatorics · Mathematics 2025-07-03 Martin Bohnert

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

Combinatorics · Mathematics 2017-06-30 Yi Bo

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

Machine Learning · Computer Science 2020-06-25 Luis A. Lastras

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

Exactly Solvable and Integrable Systems · Physics 2020-10-28 Andrew N. W. Hone , Joe Pallister

In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…

Combinatorics · Mathematics 2022-12-07 Neil J. Y. Fan , Yao Li

Generalized matrix Lotka-Volterra lattice equations are obtained in a systematic way from a "master equation" possessing a bicomplex formulation.

Exactly Solvable and Integrable Systems · Physics 2009-11-07 Aristophanes Dimakis , Folkert Muller-Hoissen

We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…

Rings and Algebras · Mathematics 2011-10-04 Miguel Couceiro , Tamás Waldhauser

As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…

Combinatorics · Mathematics 2013-09-04 Matthias Henze

In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…

Combinatorics · Mathematics 2018-08-02 Quang-Nhat Le

We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.

Classical Analysis and ODEs · Mathematics 2023-01-18 D. Mbouna

In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.

Combinatorics · Mathematics 2008-12-17 Oleg Karpenkov

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

Combinatorics · Mathematics 2009-05-28 David C. Haws

We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…

Combinatorics · Mathematics 2026-02-19 Darren Gerrity , Ivan Soprunov

We study the Ehrhart $h^\ast$-polynomial of (the boundary of) a lattice polytope via regular unimodular triangulations and Gr\"obner degenerations of toric ideals. Our main result is a boundary analogue of the well-known Sturmfels…

Combinatorics · Mathematics 2026-04-28 Martina Juhnke , Steffen Schlie

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…

We generalize the classical study of Alexander polynomials of smooth or PL locally-flat knots to PL knots that are not necessarily locally-flat. We introduce three families of generalized Alexander polynomials and study their properties.…

Geometric Topology · Mathematics 2011-03-31 Greg Friedman

Based on the motivation of generalizing the correspondence between the Lax equation for the Toda lattice and the deformation theory of the orthogonal polynomials, we derive a q-deformed version of the Toda equations for both…

Exactly Solvable and Integrable Systems · Physics 2018-05-03 Chuan-Tsung Chan , Hsiao-Fan Liu

A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…

Combinatorics · Mathematics 2009-11-12 Fu Liu