Ramanujan–Petersson conjecture

Ramanujan–Petersson conjecture

In mathematics, the Ramanujan conjecture states that the Fourier coefficients au(n) of the cusp form Delta(z) of weight 12, defined in modular form theory, satisfy

:| au(p)| leq 2p^{11/2},

when p is a prime number. This implies an estimate that is only slightly weaker for all the au(n), namely O(n^{frac{11}{2}+varepsilon}) for any varepsilon > 0. This conjecture of Ramanujan was confirmed by the proof of the Weil conjectures in 1973. The formulations required to show it was a consequence were delicate and not at all obvious. It was the work of Michio Kuga with contributions also by Mikio Sato, Goro Shimura, and Yasutaka Ihara, followed by Pierre Deligne. The existence of the connection inspired some of the deep work in the late 1960s when the consequences of the étale cohomology theory were being worked out.

The more general Ramanujan–Petersson conjecture for cusp forms in the theory of elliptic modular forms for congruence subgroups has a similar formulation, with exponent (k-1)/2 where k is the weight of the form. These results also follow from the Weil conjectures, except for the case k = 1, where it is a result of Deligne and Jean-Pierre Serre. It is named for Hans Petersson (1902 – 1984).

In the language of automorphic representations, a very broad generalisation is possible; but it was shown to be too optimistic, by the particular case of GSp_4, i.e. the similitude group of the four-dimensional symplectic group, for which counter-examples were found. The appropriate generalised form for the Ramanujan conjecture is still though hoped for; the formulation of the Arthur conjectures is in terms which explain the mechanism leading to the known kind of counterexample.

Applications

The most celebrated application of the Ramanujan conjecture is the explicit construction of Ramanujan graphs by Lubotzky, Phillips and Sarnak. In fact, this conjecture gave a name to the graphs.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Conjetura de Ramanujan–Petersson — En matemática, la conjetura de Ramanujan, llamada así en honor a Srinivasa Ramanujan, postula que los coeficientes de Fourier de la forma cúspide de valor 12, definida en la teoría de formas modulares satisface que, donde p es un número primo.… …   Wikipedia Español

  • Birch and Swinnerton-Dyer conjecture — Millennium Prize Problems P versus NP problem Hodge conjecture Poincaré conjecture Riemann hypo …   Wikipedia

  • Hans Petersson — (26 June 1902 ndash; 1984) was a German mathematician. He introduced the Petersson inner product and is also known for the Ramanujan Petersson conjecture.Petersson was born in Bentschen and died in Münster …   Wikipedia

  • Riemann hypothesis — The real part (red) and imaginary part (blue) of the Riemann zeta function along the critical line Re(s) = 1/2. The first non trivial zeros can be seen at Im(s) = ±14.135, ±21.022 and ±25.011 …   Wikipedia

  • List of mathematics articles (R) — NOTOC R R. A. Fisher Lectureship Rabdology Rabin automaton Rabin signature algorithm Rabinovich Fabrikant equations Rabinowitsch trick Racah polynomials Racah W coefficient Racetrack (game) Racks and quandles Radar chart Rademacher complexity… …   Wikipedia

  • Liste de conjectures mathématiques — Ce qui suit est une liste de conjectures mathématiques, non exhaustive. Elles sont divisées en quatre sections, en accord avec leur état en 2011. Voir aussi : Conjecture d Erdős (en), qui liste des conjectures de Paul Erdős et de ses… …   Wikipédia en Français

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • Liste Des Matières De La Théorie Des Nombres — Article détaillé : cryptologie. . Sommaire 1 Facteur (mathématiques) 2 Fractions 3 Arithmétique modulaire 4 …   Wikipédia en Français

  • Liste des matieres de la theorie des nombres — Liste des matières de la théorie des nombres Article détaillé : cryptologie. . Sommaire 1 Facteur (mathématiques) 2 Fractions 3 Arithmétique modulaire 4 …   Wikipédia en Français

  • Liste des matières de la théorie des nombres — Article détaillé : cryptologie. . Sommaire 1 Facteur (mathématiques) 2 Fractions 3 Arithmétique modulaire 4 Test de primalité e …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”