Ramanujan graphs
From MaRDI portal
Publication:1112836
DOI10.1007/BF02126799zbMath0661.05035DBLPjournals/combinatorica/LubotzkyPS88OpenAlexW4235946010WikidataQ56442222 ScholiaQ56442222MaRDI QIDQ1112836
Alexander Lubotzky, Ralph S. Phillips, Peter C. Sarnak
Publication date: 1988
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02126799
Related Items (only showing first 100 items - show all)
A construction of combinatorial NLTS ⋮ On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem ⋮ On the diameter and bisector size of Cayley graphs ⋮ Recent Developments in Low-Density Parity-Check Codes ⋮ Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap ⋮ Graphs with high second eigenvalue multiplicity ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Assouad-Nagata dimension and gap for ordered metric spaces ⋮ A randomized construction of high girth regular graphs ⋮ Gap sets for the spectra of cubic graphs ⋮ Spectra of infinite graphs via freeness with amalgamation ⋮ A simple proof for the lower bound of the girth of graphs \(D(n,q)\) ⋮ Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings ⋮ On the cop number of graphs of high girth ⋮ A spectral bound for vertex-transitive graphs and their spanning subgraphs ⋮ One-matching bi-Cayley graphs and homogeneous bi-Cayley graphs over finite cyclic groups ⋮ Adventures in Supersingularland ⋮ Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) ⋮ The limit theorem with respect to the matrices on non-backtracking paths of a graph ⋮ Universal Features for High-Dimensional Learning and Inference ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Kneser's method of neighbors ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Spectrum of random d‐regular graphs up to the edge ⋮ On sparse parity check matrices (extended abstract) ⋮ On the eigenvalues of the graphs \(D(5,q)\) ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Parameterized Counting and Cayley Graph Expanders ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Almost quasi-isometries and more non-C*-exact groups ⋮ The Ramsey number of a long even cycle versus a star ⋮ Equitable partition for some Ramanujan graphs ⋮ Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs ⋮ Improved non-approximability results for vertex cover with density constraints ⋮ Small diameters and generators for arithmetic lattices in \(\mathrm{SL}_2 (\mathbb{R})\) and certain Ramanujan graphs ⋮ On inverted Kloosterman sums over finite fields ⋮ The asymptotics of \(r(4,t)\) ⋮ Graphs of large chromatic number ⋮ Interactions of computational complexity theory and mathematics ⋮ Constructions of strongly regular Cayley graphs derived from weakly regular bent functions ⋮ Mixing in High-Dimensional Expanders ⋮ Simply transitive quaternionic lattices of rank 2 overq(t) and a non-classical fake quadric ⋮ Unnamed Item ⋮ Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝 ⋮ Metric number theory of Fourier coefficients of modular forms ⋮ Excluded Forest Minors and the Erdős–Pósa Property ⋮ Comparison of Metric Spectral Gaps ⋮ Component Games on Regular Graphs ⋮ Regular maps on surfaces with large planar width ⋮ Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity ⋮ Selberg zeta functions over function fields ⋮ The size-Ramsey number of trees ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ The cut metric, random graphs, and branching processes ⋮ Cycle density in infinite Ramanujan graphs ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ Collisions for the LPS Expander Graph Hash Function ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Explicit Near-Ramanujan Graphs of Every Degree ⋮ Experiments with the Markoff Surface ⋮ What Do Networks and Elliptic Curves Have in Common? ⋮ Spectral analysis of the affine graph over the finite ring ⋮ On encoding symbol degrees of array BP-XOR codes ⋮ Explicit spectral gaps for random covers of Riemann surfaces ⋮ Simple and optimal randomized fault-tolerant rumor spreading ⋮ Quantum ergodicity for quantum graphs without back-scattering ⋮ Hard constraint satisfaction problems have hard gaps at location 1 ⋮ Small complete minors above the extremal edge density ⋮ Affine linear sieve, expanders, and sum-product ⋮ Upper bounds on the bisection width of 3- and 4-regular graphs ⋮ Zeta functions of finite graphs and coverings. III ⋮ Robust gossiping with an application to consensus ⋮ Symmetric unique neighbor expanders and good LDPC codes ⋮ Poisson-Dirichlet distribution for random Belyi surfaces ⋮ Cutoff on all Ramanujan graphs ⋮ Explicit construction of linear sized tolerant networks ⋮ Affine extractors over large fields with exponential error ⋮ A bipartite analogue of Dilworth's theorem ⋮ Expansion in SL\(_2(\mathbb R)\) and monotone expanders ⋮ Tactical configurations and their generic ring ⋮ Sorting in rounds ⋮ New spectral lower bounds on the bisection width of graphs ⋮ Functional limit theorems for random regular graphs ⋮ Colorings of the \(d\)-regular infinite tree ⋮ Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ Strong uniform expansion in \(\text{SL}(2,p)\). ⋮ Constructing uniquely realizable graphs ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Integral circulant Ramanujan graphs of prime power order ⋮ On the spectrum of Wenger graphs ⋮ Design of highly synchronizable and robust networks ⋮ On regular hypergraphs of high girth ⋮ Extremal edge polytopes ⋮ Cayley-type graphs for group-subgroup pairs ⋮ Low-distortion embeddings of graphs with large girth ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ On dissemination thresholds in regular and irregular graph classes ⋮ Classical Kloosterman sums: representation theory, magic squares, and Ramanujan multigraphs ⋮ Graph spectra in computer science ⋮ Shaping bursting by electrical coupling and noise
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Explicit construction of regular graphs without small cycles
- Girths of bipartite sextet graphs
- Eigenvalues and expanders
- Schottky groups and Mumford curves
- Explicit constructions of graphs without short cycles and low density codes
- Quaternäre quadratische Formen und die Riemannsche Vermutung für die Kongruenzzetafunktion
- Symmetric Random Walks on Groups
- Hecke operators and distributing points on the sphere I
- Fibre Systems of Jacobian Varieties: (III. Fibre Systems of Elliptic Curves)
This page was built for publication: Ramanujan graphs
