English
Related papers

Related papers: 2-levelness of Marked Poset Polytopes and the Ehrh…

200 papers

Let $\mathscr{O}(P)$ and $\mathscr{C}(P)$ denote the order polytope and chain polytope, respectively, associated with a finite poset $P$. We prove the following result: if $P$ is a maximal ranked poset, then the number of triangular…

Combinatorics · Mathematics 2025-03-17 Aki Mori

Let $K[\mathcal{O}(P)]$ denote the toric ring of the order polytope $\mathcal{O}(P)$ of a finite partially ordered set $P$ and $K[\mathcal{C}(P)]$ that of the chain polytope $\mathcal{C}(P)$. It will be shown that $\beta_{p,…

Combinatorics · Mathematics 2018-12-27 Takayuki Hibi , Akihiro Higashitani

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…

Combinatorics · Mathematics 2024-12-02 Girtrude Hamm , Johannes Hofscheier , Alexander Kasprzyk

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

Combinatorics · Mathematics 2025-08-26 Frédéric Chapoton

The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…

Quantum Algebra · Mathematics 2007-05-23 Vadim V. Borzov

We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…

Combinatorics · Mathematics 2018-06-18 Samuel Fiorini , Marco Macchia , Kanstantsin Pashkovich

We extend the notion of chain algebra, originally defined in \cite{GN} for finite distributive lattices, to that of finite pure posets. We show this algebra corresponds to the Ehrhart ring of a (0,1)-polytope, termed the chain polytope, and…

Combinatorics · Mathematics 2025-05-21 Dancheng Lu

We say a polytope is Ehrhart positive if all the coefficients in its Ehrhart polynomial are positive. Answering an Ehrhart positivity question posed on Mathoverflow, Stanley provided an example of a non-Ehrhart-positive order polytope of…

Combinatorics · Mathematics 2020-09-08 Fu Liu , Akiyoshi Tsuchiya

The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…

Combinatorics · Mathematics 2007-05-23 Amitava Bhattacharya , S. Sivasubramanian , Murali K. Srinivasan

We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.

Combinatorics · Mathematics 2011-05-24 Michele D'Adderio , Luca Moci

The order polytopes arising from the finite poset were first introduced and studied by Stanley. For any positive integer $d\geq 14$, Liu and Tsuchiya proved that there exists a non-Ehrhart positive order polytope of dimension $d$. They also…

Combinatorics · Mathematics 2026-04-13 Feihu Liu , Guoce Xin , Zihao Zhang

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…

Statistics Theory · Mathematics 2016-04-08 Thomas Kahle , Walter Wenzel , Nihat Ay

There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…

Combinatorics · Mathematics 2024-09-24 Eleonore Bach , Matthias Beck , Sophie Rehberg

A graph whose nodes have degree 1 or 3 is called a $\{1,3\}$-graph. Liu and Osserman associated a polytope to each $\{1,3\}$-graph and studied the Ehrhart quasi-polynomials of these polytopes. They showed that the vertices of these…

Combinatorics · Mathematics 2021-04-23 Cristina G. Fernandes , José C. de Pina , Jorge L. Ramírez Alfonsín , Sinai Robins

We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We…

Combinatorics · Mathematics 2026-01-27 Jose Antonio Arciniega-Nevarez , Marko Berghoff , Eric Dolores-Cuenca

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

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

Mathematical Physics · Physics 2007-05-23 Nicolae Cotfas

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

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 classify path polyominoes which are level and pseudo-Gorenstein. Moreover, we compute all level and pseudo-Gorenstein simple thin polyominoes with rank less than or equal to 10. We also compute the regularity of the pseudo-Gorenstein…

Commutative Algebra · Mathematics 2023-09-12 Giancarlo Rinaldo , Francesco Romeo , Rajib Sarkar