Values of |τ(n)| for n < 16,000 with a logarithmic scale. The blue line picks only the values of n that are multiples of 121.

The Ramanujan tau function, studied by Ramanujan (1916), is the function defined by the following identity:

where q = exp(2πiz) with Im z > 0, is the Euler function, η is the Dedekind eta function, and the function Δ(z) is a holomorphic cusp form of weight 12 and level 1, known as the discriminant modular form (some authors, notably Apostol, write instead of ). It appears in connection to an "error term" involved in counting the number of ways of expressing an integer as a sum of 24 squares. A formula due to Ian G. Macdonald was given in Dyson (1972).

Values

The first few values of the tau function are given in the following table (sequence A000594 in the OEIS):

n 12345678910111213141516
τ(n) 1−24252−14724830−6048−1674484480−113643−115920534612−370944−5777384018561217160987136

Ramanujan's conjectures

Ramanujan (1916) observed, but did not prove, the following three properties of τ(n):

  • τ(mn) = τ(m)τ(n) if gcd(m,n) = 1 (meaning that τ(n) is a multiplicative function)
  • τ(pr + 1) = τ(p)τ(pr) − p11 τ(pr − 1) for p prime and r > 0.
  • |τ(p)| ≤ 2p11/2 for all primes p.

The first two properties were proved by Mordell (1917) and the third one, called the Ramanujan conjecture, was proved by Deligne in 1974 as a consequence of his proof of the Weil conjectures (specifically, he deduced it by applying them to a Kuga-Sato variety).

Congruences for the tau function

For k and n>0, define σk(n) as the sum of the kth powers of the divisors of n. The tau function satisfies several congruence relations; many of them can be expressed in terms of σk(n). Here are some:[1]

  1. [2]
  2. [2]
  3. [2]
  4. [2]
  5. [3]
  6. [3]
  7. [4]
  8. [5]
  9. [5]
  10. [6]

For p ≠ 23 prime, we have[1][7]

  1. [8]

Explicit formula

In 1975 Douglas Niebur proved an explicit formula for the Ramanujan tau function:[9]

Conjectures on τ(n)

Suppose that f is a weight-k integer newform and the Fourier coefficients a(n) are integers. Consider the problem:

Given that f does not have complex multiplication, do almost all primes p have the property that a(p) ≢ 0 (mod p)?

Indeed, most primes should have this property, and hence they are called ordinary. Despite the big advances by Deligne and Serre on Galois representations, which determine a(n) (mod p) for n coprime to p, it is unclear how to compute a(p) (mod p). The only theorem in this regard is Elkies' famous result for modular elliptic curves, which guarantees that there are infinitely many primes p such that a(p) = 0, which thus are congruent to 0 modulo p. There are no known examples of non-CM f with weight greater than 2 for which a(p) ≢ 0 (mod p) for infinitely many primes p (although it should be true for almost all p). There are also no known examples with a(p) ≡ 0 (mod p) for infinitely many p. Some researchers had begun to doubt whether a(p) ≡ 0 (mod p) for infinitely many p. As evidence, many provided Ramanujan's τ(p) (case of weight 12). The only solutions up to 1010 to the equation τ(p) ≡ 0 (mod p) are 2, 3, 5, 7, 2411, and 7758337633 (sequence A007659 in the OEIS).[10]

Lehmer (1947) conjectured that τ(n) ≠ 0 for all n, an assertion sometimes known as Lehmer's conjecture. Lehmer verified the conjecture for n up to 214928639999 (Apostol 1997, p. 22). The following table summarizes progress on finding successively larger values of N for which this condition holds for all nN.

Nreference
3316799Lehmer (1947)
214928639999Lehmer (1949)
1000000000000000Serre (1973, p. 98), Serre (1985)
1213229187071998Jennings (1993)
22689242781695999Jordan and Kelly (1999)
22798241520242687999Bosman (2007)
982149821766199295999Zeng and Yin (2013)
816212624008487344127999Derickx, van Hoeij, and Zeng (2013)

Ramanujan's L-function

Ramanujan's L-function is defined by

if and by analytic continuation otherwise. It satisfies the functional equation

and has the Euler product

Ramanujan conjectured that all nontrivial zeros of have real part equal to .

Notes

  1. 1 2 Page 4 of Swinnerton-Dyer 1973
  2. 1 2 3 4 Due to Kolberg 1962
  3. 1 2 Due to Ashworth 1968
  4. Due to Lahivi
  5. 1 2 Due to D. H. Lehmer
  6. Due to Ramanujan 1916
  7. Due to Wilton 1930
  8. Due to J.-P. Serre 1968, Section 4.5
  9. Niebur, Douglas (September 1975). "A formula for Ramanujan's $\tau$-function". Illinois Journal of Mathematics. 19 (3): 448–449. doi:10.1215/ijm/1256050746. ISSN 0019-2082.
  10. N. Lygeros and O. Rozier (2010). "A new solution for the equation " (PDF). Journal of Integer Sequences. 13: Article 10.7.4.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.