Top Qs
Timeline
Chat
Perspective
Ramanujan tau function
Function studied by Ramanujan From Wikipedia, the free encyclopedia
Remove ads
Remove ads
The Ramanujan tau function, studied by Ramanujan (1916), is the function defined by the following identity:
where with , is the Euler function, is the Dedekind eta function, and the function 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).
Remove ads
Values
The first few values of the tau function are given in the following table (sequence A000594 in the OEIS):
Calculating this function on an odd square number (i.e. a centered octagonal number) yields an odd number, whereas for any other number the function yields an even number.[1]
Remove ads
Ramanujan's conjectures
Summarize
Perspective
Ramanujan (1916) observed, but did not prove, the following three properties of :
- if (meaning that is a multiplicative function)
- for prime and .
- for all primes .
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).
Remove ads
Congruences for the tau function
For and , the Divisor function is the sum of the th powers of the divisors of . The tau function satisfies several congruence relations; many of them can be expressed in terms of . Here are some:[2]
Remove ads
Explicit formula
In 1975 Douglas Niebur proved an explicit formula for the Ramanujan tau function:[10]
where is the sum of the positive divisors of .
Remove ads
Conjectures on τ ( n ) {\displaystyle \tau (n)}
Suppose that is a weight- integer newform and the Fourier coefficients are integers. Consider the problem:
- Given that does not have complex multiplication, do almost all primes have the property that ?
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 for coprime to , it is unclear how to compute . The only theorem in this regard is Elkies' famous result for modular elliptic curves, which guarantees that there are infinitely many primes such that , which thus are congruent to 0 modulo . There are no known examples of non-CM with weight greater than 2 for which for infinitely many primes (although it should be true for almost all . There are also no known examples with for infinitely many . Some researchers had begun to doubt whether for infinitely many . As evidence, many provided Ramanujan's (case of weight 12). The only solutions up to to the equation are 2, 3, 5, 7, 2411, and 7758337633 (sequence A007659 in the OEIS).[11]
Lehmer (1947) conjectured that for all , an assertion sometimes known as Lehmer's conjecture. Lehmer verified the conjecture for up to 214928639999 (Apostol 1997, p. 22). The following table summarizes progress on finding successively larger values of for which this condition holds for all .
Remove ads
Ramanujan's L {\displaystyle L} -function
Summarize
Perspective
Ramanujan's -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 .
Remove ads
Notes
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads