SearcharxivSearch

arXiv · 2609.23710

Sylvester simplices: Triangulations and Ehrhart-theoretic aspects

Abstract

The Sylvester simplex $\mathsf{Sylv}_d^k$ is a $d$-dimensional lattice simplex with exactly $k$ interior lattice points. Sylvester simplices are conjectured to be the volume maximizers among all $d$-dimensional lattice polytopes with exactly $k$ interior lattice points for any $k\geq 1$. Even stronger, it is conjectured that they maximize (entry-wise) the $h^\ast$-vector among all $d$-dimensional lattice polytopes with exactly $k$ interior lattice points. Yet, Sylvester simplices seem to be rarely studied in their own right. In particular, their Ehrhart-theoretic properties are far from being well understood. In the present article, we tackle this problem. We describe flag, regular and unimodular triangulations for the Sylvester simplices, and prove that their $h^\ast$-vectors are unimodal. Moreover, we explicitly determine the values of some entries of their $f^\ast$-vectors, and prove that they are Ehrhart magic positive up to dimension $6$ but not in dimension $7$. We conclude by detailing tables of Ehrhart-theoretic quantities (numbers of lattice points, Ehrhart polynomials, local and boundary $h^\ast$-vectors, $f^\ast$-vectors) for Sylvester simplices of dimensions 7 and lower.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jhon B. Caicedo, Federico Castillo, Martina Juhnke, Germain Poullot. 2026-09-20. Sylvester simplices: Triangulations and Ehrhart-theoretic aspects. https://arxiv.org/abs/2609.23710

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO