Search results
Results from the WOW.Com Content Network
Satake (1966) reformulated the Ramanujan–Petersson conjecture in terms of automorphic representations for GL(2) as saying that the local components of automorphic representations lie in the principal series, and suggested this condition as a generalization of the Ramanujan–Petersson conjecture to automorphic forms on other groups. Another ...
A conceptual explanation for Ramanujan's observation was finally discovered in January 2011 [3] by considering the Hausdorff dimension of the following function in the l-adic topology: P ℓ ( b ; z ) := ∑ n = 0 ∞ p ( ℓ b n + 1 24 ) q n / 24 . {\displaystyle P_{\ell }(b;z):=\sum _{n=0}^{\infty }p\left({\frac {\ell ^{b}n+1}{24}}\right)q^{n ...
Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of n ends in the digit 4 or 9, the number of partitions of n will be divisible by 5.
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).
See Winnie Li's survey on Ramanujan's conjecture and other aspects of number theory relevant to these results. [ 5 ] Lubotzky , Phillips and Sarnak [ 2 ] and independently Margulis [ 6 ] showed how to construct an infinite family of ( p + 1 ) {\displaystyle (p+1)} -regular Ramanujan graphs, whenever p {\displaystyle p} is a prime number and p ...
Lafforgue's theorem implies the Ramanujan–Petersson conjecture that if an automorphic form for GL n (F) has central character of finite order, then the corresponding Hecke eigenvalues at every unramified place have absolute value 1.
Let n be a non-negative integer and let p(n) denote the number of partitions of n (p(0) is defined to be 1).Srinivasa Ramanujan in a paper [3] published in 1918 stated and proved the following congruences for the partition function p(n), since known as Ramanujan congruences.
The initial idea is usually attributed to the work of Hardy with Srinivasa Ramanujan a few years earlier, in 1916 and 1917, on the asymptotics of the partition function.It was taken up by many other researchers, including Harold Davenport and I. M. Vinogradov, who modified the formulation slightly (moving from complex analysis to exponential sums), without changing the broad lines.