Search arXivSearch

arXiv · 2504.08539

Harmonic Morphisms of Arithmetical Structures on Graphs

Abstract

Let $ϕ\colon Γ_2 \rightarrow Γ_1$ be a harmonic morphism of connected graphs. We show that an arithmetical structure on $Γ_1$ can be pulled back via $ϕ$ to an arithmetical structure on $Γ_2$. We then show that some results of Baker and Norine on the critical groups for the usual Laplacian extend to arithmetical critical groups, which are abelian groups determined by the generalized Laplacian associated to these arithmetical structures. In particular, we show that the morphism $ϕ$ induces a surjective group homomorphism from the arithmetical critical group of $Γ_2$ to that of $Γ_1$ and an injective group homomorphism from the arithmetical critical group of $Γ_1$ to that of $Γ_2$. Finally, we prove a Riemann-Hurwitz formula for arithmetical structures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kassie Archer, Caroline Melles. 2025-04-11. Harmonic Morphisms of Arithmetical Structures on Graphs. https://arxiv.org/abs/2504.08539

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