Search arXivSearch

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

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO