Related papers: A note on palindromic $\delta$-vectors for certain…
We formulate conjectures giving combinatorial interpretations of the Ehrhart $h^*$-vector, for hypersimplices, for dilated simplices and for generic cross-sections of cubes, in terms of certain decorated ordered set partitions. All were…
Unconditional polytopes are convex polytopes that are symmetric with respect to all coordinate hyperplanes and arise naturally from anti-blocking polytopes by reflection. This paper investigates algebraic relations between an anti-blocking…
Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…
We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related…
The local $h$-polynomial was introduced by Stanley as a fundamental enumerative invariant of a triangulation $\Delta$ of a simplex. This polynomial is known to have nonnegative and symmetric coefficients and is conjectured to be…
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…
A simply connected topological space is called \emph{rationally elliptic} if the rank of its total homotopy group and its total (co)homology group are both finite. A well-known Hilali conjecture claims that for a rationally elliptic space…
We prove that a polynomial map is invertible if and only if some associated differential ring homomorphism is bijective. To this end, we use a theorem of Crespo and Hajto linking the invertibility of polynomial maps with Picard-Vessiot…
The theory of elliptic pairs, as investigated in a paper by Castravet, Laface, Tevelev, and Ugaglia, provides useful conditions to determine polyhedrality of the pseudo-effective cone, which give rise to interesting arithmetic questions…
Let H_1=SL(5), H_2=SL(3), H=H_1 \times H_2. It is known that (G,V) is a prehomogeneous vector space (see [22], [26], [25], for the definition of prehomogeneous vector spaces). A non-constant polynomial \delta(x) on V is called a relative…
The Hamiltonian approach to isomonodromic deformation systems is extended to include generic rational covariant derivative operators on the Riemann sphere with irregular singularities of arbitrary Poincar\'e rank. The space of rational…
We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…
Hypergraphic polytopes $\Delta_{\mathbb{H}}$ arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph $\mathbb{H}$. Orienting the $1$-skeleton of such a polytope by a certain generic linear functional gives rise to the…
This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…
Given a lattice polytope $P$ and a prime $p$, we define a function from the set of primitive symplectic $p$-adic lattices to the rationals that extracts the $\ell$th coefficient of the Ehrhart polynomial of $P$ relative to the given…
In this article, we prove necessary conditions for Hibi rings to satisfy Green-Lazarsfeld property $N_p$ for $p=2$ and $3$. We also show that if a Hibi ring satisfies property $N_4$, then it is a polynomial ring or it has a linear…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
A classical theorem of d'Alembert states that if a polynomial P(x) with real coefficients has a non-real root x=a+ib, then it also has a root x=a-ib. We give a short and elementary inductive proof that avoids any properties of the complex…
Pick's theorem is used to prove that if $P$ is a lattice polygon (that is, the convex hull of a finite set of lattice points in the plane), then every lattice point in the $h$-fold sumset $hP$ is the sum of $h$ lattice points in $P$.