2000 character limit reached
Cusps of Picard modular surfaces
Published 12 May 2010 in math.GT and math.NT | (1005.1980v2)
Abstract: We determine the number of cusps of minimal Picard modular surfaces. The proof also counts cusps of other Picard modular surfaces of arithmetic interest. Consequently, for each N > 0 there are finitely many commensurability classes of nonuniform arithmetic lattices in SU(2, 1) that contain an N-cusped surface. We also discuss a higher-rank analogue.
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.