English
Related papers

Related papers: A note on palindromic $\delta$-vectors for certain…

200 papers

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…

Combinatorics · Mathematics 2017-10-27 Nick Early

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…

Combinatorics · Mathematics 2026-05-20 Kenta Mori , Ryo Motomura , Hidefumi Ohsugi , Akiyoshi Tsuchiya

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$…

Combinatorics · Mathematics 2024-02-28 Ed Swartz , Prairie Wentworth-Nice , Alexander Xue

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…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins , Alexander Postnikov

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…

Metric Geometry · Mathematics 2011-10-20 Martin Henk , Achill Schuermann , Joerg M. Wills

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…

Combinatorics · Mathematics 2025-07-01 Christos A. Athanasiadis

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

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…

Algebraic Topology · Mathematics 2025-05-08 Shoji Yokura

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…

Algebraic Geometry · Mathematics 2019-05-06 Elzbieta Adamus , Teresa Crespo , Zbigniew Hajto

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…

Algebraic Geometry · Mathematics 2023-11-30 Pranavkrishnan Ramakrishnan

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…

Representation Theory · Mathematics 2009-09-25 Akihiko Yukie

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…

Exactly Solvable and Integrable Systems · Physics 2023-08-08 M. Bertola , J. Harnad , J. Hurtubise

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…

Combinatorics · Mathematics 2023-12-21 Per Alexandersson , Sam Hopkins , Gjergji Zaimi

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…

Combinatorics · Mathematics 2026-05-06 Félix Gélinas , Yirong Yang

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…

Number Theory · Mathematics 2024-04-09 Roberto Dvornicich , Francesco Veneziano , Umberto Zannier

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…

Combinatorics · Mathematics 2024-02-26 Claudia Alfes , Joshua Maglione , Christopher Voll

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…

Commutative Algebra · Mathematics 2023-05-10 Dharm Veer

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…

Computational Complexity · Computer Science 2012-10-30 Nicolas de Rugy-Altherre

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…

History and Overview · Mathematics 2013-04-17 Tord Sjödin

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$.

Number Theory · Mathematics 2020-04-17 Karl Levy , Melvyn B. Nathanson
‹ Prev 1 8 9 10 Next ›