Search arXivSearch

arXiv · 2607.23506

The Smith normal form of Laplacian matrices of simplicial annuli and high dimensional trees

Abstract

Inspired by the generalization of the formula of determinant of the distance matrix of trees to $k$-trees, we study the Smith normal form of Laplacian matrices associated with some simplicial complexes. We find relations between sandpile groups of adjacency graphs and the Smith normal form of Laplacian matrices of simplicial complexes. We use such relations to calculate the Smith normal form of the highest Laplacian matrix of simplicial annuli and $k$-trees. %The low dimensional cases seems to be more difficult to calculate. We also provide numerical experiments to visualize how good are these algebraic invariants to distinguish $k$-trees. Finally, we point out that the Graham-Lovász-Pollak matrix, used to compute the determinant of the distance matrix of trees, can be used in the context of Laplacian matrices of trees and block graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlos A. Alfaro, Jesús Uriel Medrano, Juan Pablo Serrano, Iván Téllez Téllez, Ralihe R. Villagrán. 2026-07-26. The Smith normal form of Laplacian matrices of simplicial annuli and high dimensional trees. https://arxiv.org/abs/2607.23506

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