English
Related papers

Related papers: Ehrhart polynomial and Successive Minima

200 papers

We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…

Combinatorics · Mathematics 2008-10-28 Fu Liu

We describe a new subclass of the class of real polynomials with real simple roots called self-interlacing polynomials. This subclass is isomorphic to the class of real Hurwitz stable polynomials (all roots in the open left half-plane). In…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov

Ehrhart theory is the study of the enumeration of lattice points in lattice polytopes. Equivariant Ehrhart theory is a generalization of Ehrhart theory that takes into account the action of a finite group acting via affine transformations…

Combinatorics · Mathematics 2025-09-26 Alan Stapledon

My main results are simple formulas for the surface area of d-dimensional lattice polytopes using Ehrhart theory.

Combinatorics · Mathematics 2010-02-26 Gábor Hegedüs

Motivated by long-standing conjectures on the discretization of classical inequalities in the Geometry of Numbers, we investigate a new set of parameters, which we call \emph{packing minima}, associated to a convex body $K$ and a lattice…

Metric Geometry · Mathematics 2021-01-20 Martin Henk , Matthias Schymura , Fei Xue

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 Ehrhart polynomial of a lattice polytope $P$ encodes information about the number of integer lattice points in positive integral dilates of $P$. The $h^\ast$-polynomial of $P$ is the numerator polynomial of the generating function of…

Combinatorics · Mathematics 2019-03-06 Matthias Beck , Katharina Jochemko , Emily McCullough

Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…

Numerical Analysis · Mathematics 2012-07-27 Dario A. Bini , V. Noferini

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

Number Theory · Mathematics 2007-05-23 Iskander Aliev , Martin Henk

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

Combinatorics · Mathematics 2026-05-27 Frédéric Chapoton , Christos A. Athanasiadis

The Ehrhart polynomial of the $d$-th hypersimplex $\Delta(d,n)$ of order $n$ is studied. By computational experiments and a known result for $d=2$, we conjecture that the real part of every roots of the Ehrhart polynomial of $\Delta(d,n)$…

Combinatorics · Mathematics 2014-10-20 Hidefumi Ohsugi , Kazuki Shibata

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

Combinatorics · Mathematics 2018-11-09 Gabriele Balletti

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

Combinatorics · Mathematics 2017-02-07 Filip Cools , Alexander Lemmens

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…

Studying the isotropy orbits of compact symmetric spaces Reiswich introduced a family of explicit polynomials in one variable in order to describe the unique minimal isotropy orbit of compact symmetric spaces with Dynkin diagram of type…

Differential Geometry · Mathematics 2017-08-08 Gregor Weingart

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 consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

Number Theory · Mathematics 2025-11-05 Lenny Fukshansky , Evelyne Knight

Let $K$ be a local field whose residue field has characteristic $p$ and let $L/K$ be a finite separable totally ramified extension of degree $n=up^{\nu}$. Let $\sigma_1,\dots,\sigma_n$ denote the $K$-embeddings of $L$ into a separable…

Number Theory · Mathematics 2016-08-29 Kevin Keating

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

Combinatorics · Mathematics 2012-12-27 Hoda Bidkhori

Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if…

Combinatorics · Mathematics 2018-09-05 Fu Liu
‹ Prev 1 3 4 5 6 7 10 Next ›