Counting points of schemes over finite rings and counting representations of arithmetic lattices
Abstract
We relate the singularities of a scheme X to the asymptotics of the number of points of X over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More precisely, if is an arithmetic lattice whose Q-rank is greater than one, let rn() be the number of irreducible n-dimensional representations of up to isomorphism. We prove that there is a constant C (for example, C=746 suffices) such that rn()=O(nC) for every such . This answers a question of Larsen and Lubotzky.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.