English
Related papers

Related papers: On positivity of Ehrhart polynomials

200 papers

To any poset or quasi-poset is attached a lattice polytope, whose Ehrhart polynomial we study from a Hopf-algebraic point of view. We use for this two interacting bialgebras on quasi-posets. The Ehrhart polynomial defines a Hopf algebra…

Rings and Algebras · Mathematics 2016-11-15 Loïc Foissy

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

Combinatorics · Mathematics 2019-07-23 Peter S Chami , Bernd Sing , Norris Sookoo

It is already known that order polytopes and chain polytopes are always 2-level polytopes. In general, this is not true for marked order and marked chain polytopes. We study the geometry of marked order polytopes, marked chain polytopes,…

Combinatorics · Mathematics 2025-03-26 Jan Stricker

V. Golyshev conjectured that for any smooth polytope P of dimension at most five, the roots $z\in\C$ of the Ehrhart polynomial for P have real part equal to -1/2. An elementary proof is given, and in each dimension the roots are described…

Combinatorics · Mathematics 2012-12-21 Gábor Hegedüs , Alexander M. Kasprzyk

We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most $9$ lattice points on its boundary, where a polygon $P$ is called pseudointegral if the Ehrhart function of $P$ is a polynomial. We…

Combinatorics · Mathematics 2025-01-14 Tyrrell B. McAllister , Jason S. Williford

Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…

Combinatorics · Mathematics 2018-06-05 Jang Soo Kim , U-Keun Song

This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…

Combinatorics · Mathematics 2007-06-25 Beifang Chen

The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…

Combinatorics · Mathematics 2024-09-05 Takuya Inoue , Yusuke Nakamura

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

Combinatorics · Mathematics 2011-05-16 Beifang Chen

In this paper, we show the existence of universal inequalities for the $h^*$-vector of a lattice polytope P, that is, we show that there are relations among the coefficients of the $h^*$-polynomial which are independent of both the…

Combinatorics · Mathematics 2017-03-29 Gabriele Balletti , Akihiro Higashitani

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

Combinatorics · Mathematics 2010-04-21 Felix Breuer , Aaron Dall

This article considers some q-analogues of classical results concerning the Ehrhart polynomials of Gorenstein polytopes, namely properties of their q-Ehrhart polynomial with respect to a good linear form. Another theme is a specific linear…

Quantum Algebra · Mathematics 2014-08-07 Frédéric Chapoton , Driss Essouabri

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

Mathematical Physics · Physics 2007-05-23 Franz Peherstorfer

We discover that tautological intersection numbers on $\bar{\mathcal{M}}_{g, n}$, the moduli space of stable genus $g$ curves with $n$ marked points, are evaluations of Ehrhart polynomials of partial polytopal complexes. In order to prove…

Algebraic Geometry · Mathematics 2022-09-29 Adam Afandi

We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational…

Combinatorics · Mathematics 2014-01-14 Velleda Baldoni , Nicole Berline , Matthias Köppe , Michèle Vergne

The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…

Combinatorics · Mathematics 2018-09-03 Ginji Hamano , Takayuki Hibi , Hidefumi Ohsugi

We study a generalization of the discriminant of a polynomial, which we call the tolerant. The tolerant differs by multiplication by a square from the duplicant, which was discovered in recent work on $\mathbb{P}^1$-loop spaces in motivic…

Algebraic Geometry · Mathematics 2025-12-23 Swechchha Adhikari , Brent Hall , Stephen McKean

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

Combinatorics · Mathematics 2018-02-28 Amanda Cameron , Alex Fink

This note defines a family of Laurent polynomials (indexed in the rational projective line) which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each…

Number Theory · Mathematics 2007-05-23 Francois Gueritaud

We consider linear recurrences with polynomial coefficients of Poincar\'e type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a…

Symbolic Computation · Computer Science 2024-01-18 Alaa Ibrahim , Bruno Salvy
‹ Prev 1 8 9 10 Next ›