Ramanujan graphs and expander families constructed from p-ary bent functions
A connected \(k\)-regular graph is called Ramanujan if \(|\lambda|\leq 2\sqrt{k-1}\) for every eigenvalue \(\lambda\neq \pm k\) of its adjacency matrix. A function from \(\mathbb{F}_{p^m}\) to \(\mathbb{F}_p\) is called \(p\)-ary bent if \(|\sum_{x\in \mathbb{F}_{p^m}} \zeta_p^{f(x)-Tr(\beta x)}|^2=p^m\) for each \(\beta\in \mathbb{F}_{p^m}\). Set \(D_{f,i}=\{\beta\in\mathbb{F}_{p^m}^\ast:f(\beta)=i \}\) for \(i\in \mathbb{F}_p\). Given a positive integer \(l\) and a \(p\)-ary function \(f\) on \(\mathbb{F}_{p^m}\), if \(f(ax)=a^lf(x)\) for all \(a\in \mathbb{F}_p^\ast\) and \(x\in \mathbb{F}_{p^m}\), then \(f\) is called an \(l\)-form. The main contribution of this paper is the construction of Ramanujan graphs which actually consists of Cayley graphs in the additive group of \(\mathbb{F}_{p^m}\) generated by \(D_{f,i}\), where \(i\in \mathbb{F}_p\), \(f\) is a \(p\)-ary bent function and also an \(l\)-form. The proof is done by computing the eigenvalues of these Cayley graphs based on the Walsh spectrum of \(p\)-ary bent functions.
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Finite fields and Ramanujan graphs
- Explicit construction of Ramanujan bigraphs
- Expanding graphs, Ramanujan graphs, and 1-factor perturbations
- A survey of partial difference sets
- Association schemes arising from bent functions
- Characterization of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-ary Bent Functions in Terms of Strongly Regular Graphs
- Cubic Ramanujan graphs
- Eigenvalues and expanders
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander codes
- Expander families and Cayley graphs. A beginner's guide
- Expander graphs and their applications
- Expander graphs in pure and applied mathematics
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Finite fields and Ramanujan graphs
- Fourier-invariant pairs of partitions of finite Abelian groups and association schemes
- Generalized bent functions and their properties
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 6900655 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Proofs of Two Conjectures on Ternary Weakly Regular Bent Functions
- Ramanujan graphs
- Sorting and Selecting in Rounds
- Strongly regular decompositions of the complete graph
- Strongly regular graphs associated with ternary bent functions
- Strongly regular graphs constructed from \(p\)-ary bent functions
- The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
- The CRC handbook of combinatorial designs
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions
- Expanding graphs, Ramanujan graphs, and 1-factor perturbations
- scientific article; zbMATH DE number 1465652 (Why is no real title available?)
- Connection of p-ary t-weight linear codes to Ramanujan Cayley graphs with t+1 eigenvalues
- Equitable partition for some Ramanujan graphs
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Characterization of weakly regular \(p\)-ary bent functions of \(\ell \)-form
- (2p + 1)-class association schemes from the generalized Maiorana-McFarland class
This page was built for publication: Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291671)
