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 ...
Conjecture Field Comments Eponym(s) Cites 1/3–2/3 conjecture: order theory: n/a: 70 abc conjecture: number theory: ⇔Granville–Langevin conjecture, Vojta's conjecture in dimension 1 ⇒Erdős–Woods conjecture, Fermat–Catalan conjecture Formulated by David Masser and Joseph Oesterlé. [1] Proof claimed in 2012 by Shinichi Mochizuki: n/a ...
Eve Bjørgum Bunting (née Bolton, December 19, 1928 – October 1, 2023), better known as Eve Bunting, was a Northern Irish-born American writer of more than 250 books. Her work covered a broad array of subjects and included fiction and non-fiction books.
Srinivasa Ramanujan Aiyangar [a] (22 December 1887 – 26 April 1920) was an Indian mathematician.Often regarded as one of the greatest mathematicians of all time, though he had almost no formal training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then ...
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.
Its authors have divided Elementary Number Theory, Group Theory and Ramanujan Graphs into four chapters. The first of these provides background in graph theory, including material on the girth of graphs (the length of the shortest cycle), on graph coloring, and on the use of the probabilistic method to prove the existence of graphs for which both the girth and the number of colors needed are ...
What links here; Related changes; Upload file; Special pages; Permanent link; Page information; Cite this page; Get shortened URL; Download QR code