2000 character limit reached
On -towers of graph coverings arising from a constant voltage assignment
Published 7 Jan 2025 in math.NT and math.CO | (2501.03852v2)
Abstract: We investigate properties of -towers of graph coverings that arise from a constant voltage assignment. We prove the existence and uniqueness (up to isomorphisms) of such towers. Furthermore, we study the Iwasawa invariants of these towers, and apply our results to towers of isogeny graphs enhanced with level structures, as well as towers arising from volcano graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper.