spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are...
19 KB (2,689 words) - 01:42, 4 January 2024
In mathematics, the Ramanujan conjecture, due to Srinivasa Ramanujan (1916, p. 176), states that Ramanujan's tau function given by the Fourier coefficients...
20 KB (2,484 words) - 07:20, 21 November 2024
mathematicians List of Indian mathematicians Ramanujan graph Ramanujan summation Ramanujan's constant Ramanujan's ternary quadratic form Rank of a partition...
105 KB (11,694 words) - 01:41, 12 November 2024
<2{\sqrt {d-1}}} , there are only finitely many (n, d, λ)-graphs. Ramanujan graphs are d-regular graphs for which this bound is tight, satisfying λ = max |...
38 KB (5,147 words) - 17:47, 31 October 2024
Theory, Group Theory and Ramanujan Graphs is a book in mathematics whose goal is to make the construction of Ramanujan graphs accessible to undergraduate-level...
8 KB (1,023 words) - 04:10, 11 December 2023
arrows. radius The radius of a graph is the minimum eccentricity of any vertex. Ramanujan A Ramanujan graph is a graph whose spectral expansion is as...
108 KB (15,920 words) - 07:40, 24 November 2024
finite fields. These remarkable Ramanujan graphs also have large expansion coefficient. The odd girth and even girth of a graph are the lengths of a shortest...
7 KB (903 words) - 09:27, 5 June 2024
Ihara zeta function (category Algebraic graph theory)
reinterpreted graph-theoretically. It was Toshikazu Sunada who put this suggestion into practice in 1985. As observed by Sunada, a regular graph is a Ramanujan graph...
6 KB (781 words) - 23:35, 17 August 2023
to be Ramanujan graphs, graphs with optimal expansion properties for their degree. The proof is based on Pierre Deligne's proof of the Ramanujan–Petersson...
6 KB (649 words) - 08:25, 18 June 2023
edges. It is a strongly regular graph, a distance-transitive graph, and a Ramanujan graph. Although its construction is folklore, it was named after Andries...
6 KB (714 words) - 00:30, 19 August 2023
Adjacency matrix (redirect from Adjacency matrix of a bipartite graph)
This bound is tight in the Ramanujan graphs, which have applications in many areas. Suppose two directed or undirected graphs G1 and G2 with adjacency matrices...
20 KB (2,459 words) - 14:10, 4 October 2024
theta function Ramanujan graph Ramanujan's tau function Ramanujan's ternary quadratic form Ramanujan prime Ramanujan's constant Ramanujan's lost notebook...
3 KB (244 words) - 19:07, 20 October 2024
the two-by-two p-adic special linear group. A regular finite graph is a Ramanujan graph, a mathematical model of efficient communication networks, if...
126 KB (16,772 words) - 13:18, 22 November 2024
Miguel A (2006-08-07). "Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that". Journal of Statistical Mechanics:...
6 KB (873 words) - 02:22, 8 May 2024
In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete...
16 KB (2,768 words) - 11:02, 25 October 2024
theory to construct efficient communication networks called Ramanujan graphs and Ramanujan complexes. Li did her undergraduate studies at National Taiwan...
6 KB (334 words) - 21:25, 20 November 2024
Arithmetic group (section Explicit expander graphs)
can be used to construct expander graphs (Margulis), or even Ramanujan graphs (Lubotzky-Phillips-Sarnak). Such graphs are known to exist in abundance by...
22 KB (3,301 words) - 18:38, 18 September 2024
Partition function (number theory) (redirect from Hardy–Ramanujan partition formula)
Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences...
27 KB (4,364 words) - 22:48, 7 August 2024
solving long-standing questions on the Kadison-Singer problem and on Ramanujan graphs.[1] In 2022 The Ciprian Foias Prize in Operator Theory was awarded...
4 KB (335 words) - 11:20, 5 January 2024
Alon–Boppana bound (category Algebraic graph theory)
eigenvector. The graphs that come close to meeting this bound are Ramanujan graphs, which are examples of the best possible expander graphs. Its discoverers...
9 KB (1,908 words) - 16:59, 7 February 2024
(1988), "Ramanujan graphs", Combinatorica, 8 (3): 261–277, doi:10.1007/BF02126799, MR 0963118. Tutte, W. T. (1947), "A family of cubical graphs", Proc....
9 KB (887 words) - 23:59, 13 August 2024
(with A. Lubotzky and R. Phillips) applied results in number theory to Ramanujan graphs, with connections to combinatorics and computer science. Sarnak has...
12 KB (984 words) - 00:15, 20 November 2024
2021 for their solution to long-standing conjectures in the study of Ramanujan graphs. Marcus grew up in Marietta, Georgia and was a boarding student at...
7 KB (587 words) - 02:58, 22 September 2024
gave the first construction of expander graphs, which was later generalized in the theory of Ramanujan graphs. In 1986, Margulis gave a complete resolution...
13 KB (1,366 words) - 02:15, 22 November 2024
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...
190 KB (19,533 words) - 03:03, 21 November 2024
regular bipartite graphs with arbitrarily large number of vertices such that each graph G {\displaystyle G} in the sequence is a Ramanujan graph. It is called...
17 KB (3,235 words) - 16:21, 4 October 2024
Ramanujan prime, Ramanujan summation, Ramanujan graph and Ramanujan's sum – Discovered by the Indian mathematician Srinivasa Ramanujan in the early 20th...
197 KB (22,289 words) - 12:48, 23 November 2024
Ramanujan Institute for Advanced Study in Mathematics (RIASM) is the Department of Mathematics of University of Madras. This name was adopted in 1967...
8 KB (973 words) - 12:27, 16 July 2024
Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket (2015), "Reconfiguration on sparse graphs", in Dehne, Frank; Sack, Jörg-Rüdiger;...
6 KB (712 words) - 11:49, 22 March 2024
A.; Srivastava, Nikhil (2015), "Interlacing families I: Bipartite Ramanujan graphs of all degrees", Annals of Mathematics, 182 (1): 307–325, arXiv:1304...
9 KB (594 words) - 10:18, 2 November 2024