Abstract

Let $$\overline{\mathcal{M }}_{g,[n]}$$ , for $$2g-2+n>0$$ , be the stack of genus $$g$$ , stable algebraic curves over $$\mathbb{C }$$ , endowed with $$n$$ unordered marked points. In Looijenga (J Algebraic Geom 3:283–293, 1994), Looijenga introduced the notion of Prym level structures in order to construct smooth projective Galois coverings of the stack $$\overline{\mathcal{M }}_{g}$$ . In Sect. 2 of this paper, we introduce the notion of Looijenga level structure which generalizes Looijenga construction and provides a tower of Galois coverings of $$\overline{\mathcal{M }}_{g,[n]}$$ equivalent to the tower of all geometric level structures over $$\overline{\mathcal{M }}_{g,[n]}$$ . In Sect. 3, Looijenga level structures are interpreted geometrically in terms of moduli of curves with symmetry. A byproduct of this characterization is a simple criterion for their smoothness. As a consequence of this criterion, it is shown that Looijenga level structures are smooth under mild hypotheses. The second part of the paper, from Sect. 4, deals with the problem of describing the D–M boundary of Looijenga level structures. In Sect. 6, a description is given of the nerve of the D–M boundary of abelian level structures. In Sect. 7, it is shown how this construction can be used to “approximate” the nerve of Looijenga level structures. These results are then applied to elaborate a new approach to the congruence subgroup problem for the Teichmüller modular group along the lines of Boggi (Math Nach 279(9–10):953–987, 2006).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.