Counting primes, groups and manifolds

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages

Scientific paper

10.1073/pnas.0404571101

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log n} = \frac{3-2\sqrt{2}}{4}.$ The proof is based on the Bombieri-Vinogradov `Riemann hypothesis on the average' and on the solution of a new type of extremal problem in combinatorial number theory. Similar surprisingly sharp estimates are obtained for the subgroup growth of lattices in higher rank semisimple Lie groups. If $G$ is such a Lie group and $\Gamma$ is an irreducible lattice of $G$ it turns out that the subgroup growth of $\Gamma$ is independent of the lattice and depends only on the Lie type of the direct factors of $G$. It can be calculated easily from the root system. The most general case of this result relies on the Generalized Riemann Hypothesis but many special cases are unconditional. The proofs use techniques from number theory, algebraic groups, finite group theory and combinatorics.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Counting primes, groups and manifolds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting primes, groups and manifolds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting primes, groups and manifolds will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-376149

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.