2000 character limit reached
On abelian $\ell$-towers of multigraphs
Published 24 Jun 2020 in math.CO and math.NT | (2006.14012v1)
Abstract: We study how the $\ell$-adic valuation of the number of spanning trees varies in regular abelian $\ell$-towers of multigraphs. We show that for an infinite family of regular abelian $\ell$-towers of bouquets, the behavior of the $\ell$-adic valuation of the number of spanning trees behave similarly to the $\ell$-adic valuation of the class numbers in $\mathbb{Z}_{\ell}$-extensions of number fields.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.