We investigate arithmetic, geometric and combinatorial properties of symmetric edge
polytopes. We give a complete combinatorial description of their facets. By combining …

The Eulerian polynomials and derangement polynomials are two well-studied generating
functions that frequently arise in combinatorics, algebra, and geometry. When one makes an …

The binomial Eulerian polynomials, introduced by Postnikov, Reiner, and Williams, are γ-
positive polynomials and can be interpreted as h-polynomials of certain flag simplicial …

We provide a formula for the Ehrhart polynomial of the connected matroid of size n and rank
k with the least number of bases, also known as a minimal matroid. We prove that their …

A triangulation of a simplicial complex is said to be uniform if the-vector of its restriction to a
face of depends only on the dimension of that face. This paper proves that the entries of the …

The family of lattice simplices in $\mathbb {R}^ n $ formed by the convex hull of the standard
basis vectors together with a weakly decreasing vector of negative integers include …

It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties
shared by the Riemann ζ ζ function. The construction was generalized by Matsui et al. to a …

Polynomials which afford nonnegative, real‐rooted symmetric decompositions have been
investigated recently in algebraic, enumerative and geometric combinatorics. Brändén and …

The Ehrhart quasipolynomial of a rational polytope P encodes the number of integer lattice
points in dilates of P, and the h^* h∗-polynomial of P is the numerator of the accompanying …

We study rational generating functions of sequences that agree with a polynomial and
investigate symmetric decompositions of the numerator polynomial for subsequences. We …