Abstract:Let ℓ be a rational prime. We show that an analogue of a conjecture of Greenberg in graph theory holds true. More precisely, we show that when n is sufficiently large, the ℓ-adic valuation of the number of spanning trees at the nth layer of a Z d ℓ -tower of graphs is given by a polynomial in ℓ n and n with rational coefficients of total degree at most d and of degree in n at most one.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.