Search arXivSearch

arXiv · 2605.11820

Classification and counting of Gorenstein simplices with $h^*$-polynomial $1+t^k+\cdots+t^{(v-1)k}$

Abstract

Hibi, Yoshida, and the author classified Gorenstein simplices which are not lattice pyramids and whose \(h^*\)-polynomials are of the form \(1+t^k+t^{2k}+\cdots+t^{(v-1)k}\) when \(v\) is a prime number or the product of two prime numbers. They also conjectured that, for general \(v\), the number of unimodular equivalence classes of such simplices depends only on the divisor lattice of \(v\). This paper proves the conjecture by giving a constructive classification of Gorenstein simplices whose \(h^*\)-polynomials are of this form. More precisely, their unimodular equivalence classes are shown to be parametrized by strict divisor chains in the divisor lattice of \(v\) together with certain recursive combinatorial data. As a consequence, an explicit formula for the number of equivalence classes in terms of the divisor lattice of \(v\) is obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akiyoshi Tsuchiya. 2026-05-12. Classification and counting of Gorenstein simplices with $h^*$-polynomial $1+t^k+\cdots+t^{(v-1)k}$. https://arxiv.org/abs/2605.11820

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