Finite fields and Ramanujan graphs
From MaRDI portal
Publication:1362096
DOI10.1006/JCTB.1996.1740zbMATH Open0881.05086OpenAlexW2095476768MaRDI QIDQ1362096FDOQ1362096
Authors: Juan Arias de Reyna
Publication date: 12 August 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.1740
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Finite fields and commutative rings (number-theoretic aspects) (11T99)
Cites Work
- Eigenvalues and expanders
- Title not available (Why is that?)
- Ramanujan graphs
- Title not available (Why is that?)
- Cubic Ramanujan graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- A new series of dense graphs of high girth
- Diameters and Eigenvalues
- Superconcentrators
- An Estimate for Character Sums
- Limitations on Explicit Constructions of Expanding Graphs
- Title not available (Why is that?)
- Estimates for Soto-Andrade sums.
- Is computing with the finite Fourier transform pure or applied mathematics?
- Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
- Ramanujan graphs and Hecke operators
- The second eigenvalue of regular graphs of given girth
- Margulis
- On the eigenvectors of Schur's matrix
- Title not available (Why is that?)
- Eigenvalue bounds and girths of graphs of finite, upper half-planes
Cited In (21)
- Title not available (Why is that?)
- Ramanujan edge-indexed graphs
- Explicit construction of a Ramanujan \((n_1,n_2,\dots,n_{d-1})\)-regular hypergraph
- A natural graph of finite fields distinguishing between models
- Abelian Ramanujan graphs
- Title not available (Why is that?)
- Finite Euclidean graphs over \(\mathbb{Z}_{2^r}\) are non-Ramanujan
- Ramanujan graphs
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- Note on the girth of Ramanujan graphs
- On parameters of some graphs from finite fields
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
- Finite fields and the 1‐chromatic number of orientable surfaces
- Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata
- Explicit near-Ramanujan graphs of every degree
- Ramanujan graphs and Ramanujan hypergraphs
- Title not available (Why is that?)
- Finite Euclidean graphs and Ramanujan graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Finite fields and Ramanujan graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362096)