Search arXivSearch

arXiv · 2511.03822

Smith Normal Forms of Graphical Hermite Simplices

Abstract

We introduce the family of graphical Hermite simplices and study the Smith normal forms of their matrices of vertex vectors, which is equivalent to studying the group structure of the cokernels for these matrices. Our motivation is to study the behavior of lattice simplices subject to small lattice perturbations of their vertices. In this case, a graphical Hermite simplex is a perturbation of a rectangular simplex, i.e., a simplex defined by a diagonal matrix and the origin, with the perturbation controlled by the structure of a directed graph. We first establish sufficient conditions on the graphs and diagonal entries of these matrices that imply having a single non-unit invariant factor, i.e., a cyclic cokernel. We then obtain bounds on the invariant factors of the defining matrices related to lengths of paths in the corresponding directed graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Braun, Antwon Park. 2026-06-22. Smith Normal Forms of Graphical Hermite Simplices. https://arxiv.org/abs/2511.03822

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