The Eigenvalues of the Graphs $D(4,q)$
G. Eric Moorhouse, Shuying Sun, Jason Williford

TL;DR
This paper determines the eigenvalues of the graphs D(4,q), revealing they are excellent expanders close to Ramanujan graphs, which enhances understanding of their spectral and expansion properties.
Contribution
The paper computes the spectrum of D(4,q) graphs, the smallest open case, showing they are nearly Ramanujan expanders with specific eigenvalue bounds.
Findings
Eigenvalues other than ±q are bounded by 2√q
Graphs are q-regular on 2q^4 vertices
Graphs are nearly Ramanujan expanders
Abstract
The graphs have connected components giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak and Margulis. Despite this, little about the spectrum and expansion properties of these graphs is known. In this paper we find the spectrum for , the smallest open case. For each prime power , the graph is -regular graph on vertices, all of whose eigenvalues other than are bounded in absolute value by . Accordingly, these graphs are good expanders, in fact very close to Ramanujan.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The Eigenvalues of the Graphs
G. Eric Moorhouse
Shuying Sun
Jason Williford
Department of Mathematics, University of Wyoming, Laramie WY 82071 USA
Department of Mathematical Sciences, University of Delaware, Newark DE 19716 USA
Abstract
The graphs have connected components giving the best known bounds on extremal problems with forbidden even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak [15] and Margulis [16, 17]. Despite this, little about the spectrum and expansion properties of these graphs is known. In this paper we find the spectrum for , the smallest open case. For each prime power , the graph is -regular graph on vertices, all of whose eigenvalues other than are bounded in absolute value by . Accordingly, these graphs are good expanders, in fact very close to Ramanujan.
keywords:
expander graph, Cayley graph, graph spectrum
1 Introduction
Let be a graph with vertex set . (All our graphs are undirected and have no loops or multiple edges. See e.g. [6, 3] for standard terminology and theory of graphs.) Given a set of vertices , we define to be the set of vertices in which are adjacent to some vertex of . The isoperimetric constant of is defined to be
[TABLE]
An infinite family of -regular graphs whose isoperimetric constants are uniformly bounded away from 0 is an expander family. The best known general bounds on are expressed in terms of the spectrum of , i.e. the multiset of eigenvalues of its adjacency matrix. In particular, if is -regular with second-largest eigenvalue , then
[TABLE]
see e.g. [9, Prop.1.84]. (The second-largest eigenvalue is denoted differently in some sources, including [9].) Thus to certify an infinite family of -regular graphs as an expander family, we require a uniform lower bound on the spectral gap . A -regular connected graph is Ramanujan if ; by the Alon-Boppana Theorem (see e.g. [9, Ch.3]) this bound is asymptotically best possible for any infinite family of -regular graphs.
In searching for good families of explicitly defined graphs with good expansion, a particularly promising infinite family of graphs is the sequence
[TABLE]
defined by Lazebnik and Ustimenko [10] for each prime power . Each graph in this sequence is bipartite -regular on vertices having girth (or , when is even); and each connecting map ‘’ is a graph-theoretic cover (see [12, Sec.3B]). The graphs are connected for and odd; see [11]. The covering property ensures that the girth of is weakly increasing as , and the spectrum of embeds in that of ; see [12, Sec.3C].
The graphs are important in the study of Turán type problems on even cycles, giving better lower bounds on the maximum number of edges in graphs of girth than the well-known Ramanujan graphs of Lubotzky, Phillips and Sarnak [15]. Similarly, the graphs of Alon et al. [1], another expander family with fixed degree, have girth 3 (after removing loops). By comparison, therefore, one might expect the graphs to have very good expansion properties.
However, little is known about the eigenvalues of these graphs. In fact, to date only the spectrum of and are known, their characteristic polynomials being
[TABLE]
and
[TABLE]
respectively; see [13, Sec.5]. In particular, these graphs are Ramanujan. However, Reichard [19] and Thomason [20] independently showed by computer that the graphs are not Ramanujan for certain , refuting the claim of [21]; see also the final note in this paper where we investigate this question more closely. The same statements apply to for all , since the spectrum of is embedded in that of for .
It was later claimed in [22] that the eigenvalues of other than are bounded by . However, a flaw was later found in the argument, leaving the problem open; see the Math Review MR2048644 for [22]. To date, we have not found any counterexample to this statement, so we list it as a conjecture. Following [10], we denote by a connected component of ; and we note that whenever .
Conjecture 1.1** (Ustimenko)**
For all , has second largest eigenvalue less than or equal to .
In this paper we verify Conjecture 1.1 for :
Theorem 1.2
The second largest eigenvalue of is less than or equal to .
This implies that these graphs are very close to Ramanujan. Our proof is given in Section 5 for even , and in Section 6 for odd . A more explicit determination of the spectrum is given in Section 7 for prime values .
Our approach is similar to [4], in that we first realize the halved (point) graph of as a Cayley graph of a certain -group . Unlike the situation for the Wenger graphs in [4], or the graphs and , our group is nonabelian whenever is odd, thus requiring more extensive use of the representation theory of . Finally, our bounds on eigenvalues are obtained using Weil’s bound for exponential sums over , or over Galois rings of characteristic 3 in the case .
2 The Graphs and their Point Collinearity Graphs
Throughout, we take where is a prime power. The graph is bipartite and -regular with vertices. These include vertices called points, and vertices called lines, where all coordinates are in ; and the point and line (with coordinates as above) are incident iff
[TABLE]
Also denote by the point collinearity graph of , i.e. the graph whose vertices are the points of , two points being adjacent in iff they are distinct but collinear in ; see e.g. [3, Sec.14.2.2]. One checks that two vertices are adjacent in (i.e. distinct and collinear in ) iff
[TABLE]
The adjacency matrix of has the form where is a matrix for which
[TABLE]
is the adjacency matrix of (with the first rows and columns indexed by points, and the last rows and columns indexed by lines). Note that is a -regular graph on vertices. The spectra of and are in direct relationship. Indeed, elementary methods yield the following, which is also implicit in [4, 13]:
Lemma 2.1
Denote the characteristic polynomial of , the adjacency matrix of , by . Then the characteristic polynomial of , the adjacency matrix of , is .\qed
Equivalently, every eigenvalue of , with multiplicity , corresponds to a pair of eigenvalues of , each with multiplicity (or a single eigenvalue [math] of multiplicity in case ). The remainder of this paper is devoted to proving
Theorem 2.2
The graph is connected except for , when the graph has 4 connected components. When is odd, the adjacency matrix of has characteristic polynomial of the form
[TABLE]
where all roots of have the form where . Each such value lies the ring {\mathbb{Z}}\bigl{[}2\cos\frac{2\pi}{p}\bigr{]}, or {\mathbb{Z}}\bigl{[}2\cos\frac{2\pi}{9}\bigr{]} if .
A complete determination of is given in Theorem 5.1 when is even, and in Theorem 7.6 when is prime. Now using Lemma 2.1 we obtain
Theorem 2.3
The graph has eigenvalues , each of multiplicity 1 (unless when each of the eigenvalues has multiplicity 4). All remaining eigenvalues have the form where .
Once again, the eigenvalues of Theorem 2.3 are cyclotomic integers satisfying the conclusion of Theorem 2.2. In Theorem 2.2 the multiplicity of the eigenvalue 0 may actually exceed ; in particular this happens whenever . We find explicit formulas for the actual eigenvalues, by expressing the ‘error’ terms as exponential sums defined over finite fields (or over the Galois ring of order and characteristic 9, in the case ). This leads to our bound , using the Hasse-Davenport-Weil bound when , ; or the analogous bound of Kumar, Helleseth and Calderbank [8] in the case .
Our strategy for proving this result (see [2] for details) is to first realize as a Cayley graph Cay for a nonabelian group of order , and connection set . (Thus has vertices labeled by elements of ; and two vertices are adjacent in iff ). Since our graph is undirected and connected with no loops or multiple edges, we will have , , and iff . We then determine the number of conjugacy classes of , and a complete set (up to equivalence) of irreducible ordinary representations for . For each , we compute the complex matrix .
Theorem 2.4** ([2, 5]; see also [9])**
The characteristic polynomial of , the adjacency matrix of , is given by
[TABLE]
Note that this gives eigenvalues (counting according to their respective multiplicities) as required. In those cases where is abelian, the eigenvalues are simply the character values . A similar simplification is possible when is a union of conjugacy classes of , but this does not apply in our case. When is nonabelian and the full matrices of the representations are not explicitly known, determining the eigenvalues of from the character values alone may require substantial additional work (see [2]); but for us, the group is sufficiently nice that explicit descriptions of the full matrices of the representations are easily available, making our job much easier.
3 Background on Finite Fields
General results on finite fields can be found in [14]. Let be a field of order where and is prime. The absolute trace map is
[TABLE]
We also fix a primitive -th root of unity ; here it suffices to assume that . We define the exponential sum of an arbitrary function as the cyclotomic integer
[TABLE]
Lemma 3.1
For every polynomial of the form we have
[TABLE]
Proof 1
See [14, Ch.5].\qed
Lemma 3.2
Let be a non-negative integer. Then
[TABLE]
Proof 2
See [14, p.271].\qed
Lemma 3.3
- (i)
Let be the number of nonzero polynomials having exactly distinct roots in . Then
[TABLE]
and otherwise. Here ; and for we include irreducible quadratics and nonzero constant polynomials.
- (ii)
For even, let be the number of nonzero polynomials having exactly distinct nonzero roots in . Then
[TABLE]
and otherwise. Here .
Proof 3
Every nonzero polynomial of degree with a single root has the form or , giving . Every nonzero polynomial of degree having two distinct roots has the form with and ; and there are such polynomials. This leaves , and the remaining assertions of (i) follow.
Now suppose is even, and consider a nonzero polynomial . If then ; so in characteristic 2, the number of distinct nonzero roots must be 0, 1 or 3. There are nonzero polynomials of the form where are nonzero and distinct. There are cubics of the form where ; and by (i), there are cubics of the form (t+t_{1})\bigl{(}a_{3}t^{2}+a_{3}t_{1}t+\frac{a_{0}}{t_{1}}\bigr{)} for which and the quadratic factor is irreducible. These, together with the polynomials having , give
[TABLE]
This leaves
[TABLE]
One checks that this includes irreducible cubics of the required form, together with polynomials of the form with , and nonzero constant polynomials.\qed
4 A Regular Group of Automorphisms of
For all we define the matrix
[TABLE]
These matrices form a subgroup acting regularly on points via
[TABLE]
which can be written simply as
[TABLE]
after a slight abuse of notation by which we identify
[TABLE]
One checks that this action preserves collinearity of points, and so gives a group of automorphisms of which is regular on the vertices. Thus is a Cayley graph Cay for the set of elements
[TABLE]
The commutator of two typical elements of is
[TABLE]
At this point we must consider separately the cases even and odd, for which is abelian or nonabelian, respectively.
5 The case even
In this section we suppose is even, so that
[TABLE]
In this case is elementary abelian, with irreducible linear characters
[TABLE]
Theorem 5.1
Suppose is even. Then the characteristic polynomial of , the incidence matrix of , is
[TABLE]
The graph is connected for ; while for , has 4 connected components.
Proof 4
By Theorem 2.4 and Lemma 3.1, we have
[TABLE]
Now using the fact that the map , is an automorphism (in particular bijective and trace-preserving),
[TABLE]
After re-indexing via ,
[TABLE]
If the polynomial has a unique nonzero root , then the map , takes each of the values in exactly times, in which case
[TABLE]
Similarly, if (as above) has three distinct nonzero roots , then and the map , attains each of the triples exactly times, in which case
[TABLE]
Thus
[TABLE]
where is given by Lemma 3.3(ii). Simplification yields the formula claimed for . Now we simply read off the multiplicity of the largest eigenvalue to obtain the number of connected components of (see e.g. [3, Prop.1.3.8]).\qed
6 The case is odd
Here and for the remainder of this paper, we take to be odd. From the general formula for commutators in given at the end of Section 4, we deduce the commutator subgroup and centre
[TABLE]
also the centralizer of a noncentral element (i.e. with ) is a subgroup
[TABLE]
of order . So has conjugacy classes ( of size 1, and of size ). There are linear characters of , given by
[TABLE]
where . As in Section 3, is a complex -th root of unity and is the trace map. The remaining irreducible characters of may be found by inducing linear characters of a subgroup of order (thus yielding monomial representations of degree ); but guided by a little hindsight, we will instead directly exhibit the missing representations and show that they are irreducible and distinct. For each pair with , we define by
[TABLE]
using the Kronecker delta notation or according as either differ or coincide. It is routine to check that for all , and ; so is a representation of degree . The associated character is found to be
[TABLE]
using the fact that . These characters of are irreducible and inequivalent since
[TABLE]
These are also distinct from the characters and so we have the complete list of irreducible characters of .
Now by Theorem 2.4, the adjacency matrix of has characteristic polynomial
[TABLE]
Those eigenvalues of obtained from the linear characters of are
[TABLE]
where is the number of values such that . By Lemma 3.3(ii), the first factors of are
[TABLE]
thus the characteristic polynomial has the form
[TABLE]
Now for ,
[TABLE]
where ‘’ denotes conjugate-transpose, and we have introduced the complex matrices
[TABLE]
We first treat the cases for which we obtain
[TABLE]
Denoting by the standard basis of , we find a new basis consisting of eigenvectors of as follows:
eigenvectors of the form where , each with eigenvalue ;
- 2.
eigenvectors of the form as ranges over a set of representatives of the distinct nonzero pairs in . Each such vector has eigenvalue ;
- 3.
.
After including the factors
[TABLE]
we update our formula for the characteristic polynomial of as
[TABLE]
Finally we describe the remaining eigenvalues of arising from for .
Lemma 6.1
For any nonzero elements the matrix is similar to
Proof 5
Re-indexing rows and columns of via , we see that
[TABLE]
where and are permutation matrices, and so .\qed
Corollary 6.2
If then for all nonzero , is unitarily similar to . If then there are at most three similarity classes of matrices with , represented by , and where is a primitive root.
Proof 6
If , then every element of has a cube root in ; so let be any cube root of and take . Then is similar to by Lemma 6.1. The second conclusion follows similarly.\qed
If and , then is similar to , since by Corollary 6.2, both matrices are similar to . In this case U_{3,3}=\bigl{[}\zeta^{tr(3i^{2}j-3ij^{2})}\bigr{]}_{i,j\in F} is unitarily similar to
[TABLE]
where is a diagonal matrix with diagonal entries for . In this case the vectors v_{c}=\bigl{(}\zeta^{tr(ci)}\bigr{)}_{i\in F} for form a basis of consisting of eigenvectors of ; indeed
[TABLE]
so that where
[TABLE]
Note that satisfies since ; thus \varepsilon_{f}\in{\mathbb{Z}}[\zeta+\overline{\zeta}]={\mathbb{Z}}\bigl{[}2\cos\frac{2\pi}{p}\bigr{]} (see [23, Prop.2.16]). Also has eigenvalues . The Weil bound (see e.g. [24], [14, p.223]) gives as required. The all-ones eigenvector has eigenvalue since is a permutation of ; so for we obtain
[TABLE]
When we work just a little harder. Let and use the identity
[TABLE]
to see that where
[TABLE]
and the unitary matrices and are given by
[TABLE]
Now the vectors (as above) are eigenvectors of since
[TABLE]
with corresponding eigenvalue where . Now has eigenvalues , and
[TABLE]
since as and range over the nonzero elements of , the coefficient falls in each of the three multiplicative cosets of the cubes equally often, and we recall Corollary 6.2. So for we obtain
[TABLE]
As before, \varepsilon_{f}\in{\mathbb{Z}}\bigl{[}2\cos\frac{2\pi}{p}\bigr{]} and .
Finally, suppose so that . By the Lemma, is unitarily similar to . Unlike the cases , in this case the eigenvalues of do not lie in ; rather they lie in where we abbreivate , chosen so that . This can be seen even in the case where
[TABLE]
whose eigenvalues are
[TABLE]
Likewise, the eigenvalues of lie in but not in . However we see that the eigenvalues of are expressible as exponential sums defined over Galois rings; see e.g. [8, 18]. Let be the Galois ring of order and characteristic 9. The ring enjoys the following properties:
is a commutative ring with a maximal ideal consisting of all zero divisors in , and the quotient ring is .
- 2.
The units of form a multiplicative group consisting of all elements not in . This group has a multiplicative subgroup of order .
- 3.
Every element has a unique 3-adic expansion where . where we define . In particular, is a set of representatives of the cosets .
- 4.
The trace map is defined by
[TABLE]
where . After reducing both domain and range modulo , this gives the usual absolute trace map .
After replacing by as index set for entries of our vectors and matrices, we may rewrite our basis of as v_{c}=\bigl{(}\xi^{3tr(ci)}\bigr{)}_{i\in{\mathcal{T}}} for , and
[TABLE]
which is unitarily similar to
[TABLE]
after conjugating by the unitary diagonal matrix D=\bigl{[}\xi^{tr(i^{3})}\delta_{i,j}\bigr{]}_{i,j\in{\mathcal{T}}}\,. Now
[TABLE]
so that where
[TABLE]
The ‘weighted degree’ of , as defined in [8, p.458], is ; and as shown in [8], the Weil bound holds. Once again by [23, Prop.2.16] we have \varepsilon_{f}\in{\mathbb{Z}}\bigl{[}2\cos\frac{2\pi}{9}\bigr{]}. With the notation above, we have
[TABLE]
7 Exact Spectra over Prime Fields
It is possible to refine Theorem 2.2 to express precisely. Here, however, we state such a result (Theorem 7.6 below) only for the case is prime; in the general case with , counting multiplicities is more technical and Theorem 2.2 is probably adequate for any intended applications. In the following we denote .
Lemma 7.1
Let be two functions where the field has prime order . Then iff for all .
Proof 7
If then
[TABLE]
Since the minimal polynomial of over is the cyclotomic polynomial , there exists such that for all . Since , we must have . The converse is clear.\qed
Lemma 7.2
Let and where . Then .
Proof 8
Straightforward.\qed
Let be the set of cubic polynomials of the form . By Lemma 7.2, the corresponding exponential sums for are not all distinct. We next find a set of representatives giving rise to distinct exponential sums; that is, for each there is a unique such that .
Lemma 7.3
Let where the field has prime order , and .
- (i)
For , we have iff . We may take ; and iff . Here .
- (ii)
For , we have . Let be a primitive element, i.e. a generator of the multiplicative group . We may take . Here . If then where . If then where is uniquely determined by .
Proof 9
(i) First suppose , so that where . In this case every element has a unique cube root . By Lemma 3.2,
[TABLE]
If where then for all by Lemma 7.1, so and ; but conversely, if then so by Lemma 7.2, .
If then defines a permutation of , so .
(ii) Now suppose , and write where . Again by Lemma 3.2,
[TABLE]
and
[TABLE]
If where , then as in (i), it follows that , and . We consider two cases:
Suppose ; then . We may write where and , so that . Now if satisfies , we must have . Conversely, ; so is the unique satisfying .
- 2.
Suppose ; then . If satisfies , we must have where . Conversely, ; so is the unique satisfying .\qed
In order to determine the exact spectrum of , we need to know not only when the values are distinct, but actually when the values are distinct. As preparation, we need the following.
Lemma 7.4
Let where is prime, and suppose there exists a polynomial of the form having for all . Then one of the following holds:
- (i)
, and ;
- (ii)
* and ; or*
- (iii)
* and .*
Proof 10
We will assume since the cases may be easily checked by explicit computation. First observe that for at most two values of ; this is because for any such value of , and have a linear factor in common, forcing .
For each , let . By hypothesis, ; and we have just shown that . Elementary counting arguments give . Exactly three possibilities must be considered.
Case (i): . In this case is a permutation polynomial; but then and Lemma 7.3 gives , and .
Case (ii): . Here and for some , and for all other values . Since has degree , , contradicting Lemma 3.2.
Case (iii): . Here there exist distinct values , such that
[TABLE]
Since for , Lemma 3.2 gives
[TABLE]
This gives a nontrivial linear dependence between four columns of the nonsingular Vandermonde matrix \bigl{[}a_{i}^{j}\,:\,0\leqslant i,j\leqslant 3\bigr{]}, a contradiction.\qed
Corollary 7.5
Let be a field of prime order , and suppose where and . If then we must have and .
Proof 11
If then
[TABLE]
and arguing as in the proof of Lemma 7.1, we must have for all . In particular, for all . By Lemma 7.4, . For the only cubics of the form satisfying for all , have for respectively; and no pair of such cubics can satisfy for all .
This leaves only the case and the pair of cubics , where and for respectively.\qed
Theorem 7.6
Let be an odd prime, and let be the adjacency matrix of , with characteristic polynomial .
- (i)
For , we have .
- (ii)
For , we have .
- (iii)
For , we have
[TABLE]
with distinct roots and multiplicities as indicated by the exponents.
- (iv)
For , we have
[TABLE]
with distinct roots and multiplicities as indicated by the exponents.
Proof 12
For we take , and in the notation of Section 4, and
[TABLE]
We compute
[TABLE]
and
[TABLE]
so (i) follows.
Conclusion (iii) follows immediately from the previous results; and for , the same reasoning yields
[TABLE]
where we need only to check for coincidence of roots. Straightforward computations show that and , whence
[TABLE]
similarly, , giving
[TABLE]
This yields (ii), and conclusion (iv) follows similarly from the previous results.\qed
As an example, the spectrum of contains where . Compare with and to see that while is an expander, it is not quite Ramanujan. Similar conclusions are found for other values including .
Acknowledgements
This research was supported in part by NSF grant DMS-1400281. The second author is grateful to her doctoral supervisor Dr. Felix Lazebnik for providing direction in this research.
References
- [1] N. Alon, O. Schwartz and A. Shapira, An elementary-construction of constant-degree expanders, Combin. Probab. Comput. 17 (2008) 319–327.
- [2] L. Babai, Spectra of Cayley graphs, J. Combinatorial Theory Ser. B 27 (1979) 180–189.
- [3] A.E. Brouwer and W.H. Haemers, Spectra of Graphs (Springer, New York, 2012).
- [4] S.M. Cioabă, F. Lazebnik and W. Li, On the spectrum of Wenger graphs, J. Combin. Theory Ser. B 107 (2014) 132–139.
- [5] P. Diaconis and M. Shahshahani, Generating random permutations from random transpositions, Z. Wahrsch. Verw. Gebiete 57 (1981) no. 2, 159–179.
- [6] C.D. Godsil and G. Royle, Algebraic Graph Theory (Springer, New York, 2001).
- [7] I.M. Isaacs, Character Theory of Finite Groups (Academic Press, New York, 1978).
- [8] P.V. Kumar, T. Helleseth and A.R. Calderbank, An upper bound for Weil exponential sums over Galois rings and applications, IEEE Trans. Inf. Theory (2) 41 (1995) 456–468.
- [9] M. Krebs and A. Shaheen, Expander Families and Cayley Graphs, A Beginner’s Guide (Oxford Univ. Press, Oxford, 2011).
- [10] F. Lazebnik and V.A. Ustimenko, Explicit construction of graphs with an arbitrary large girth and of large size, Discrete Appl. Math. 60 (1995) 275–284.
- [11] F. Lazebnik, V.A. Ustimenko and A.J. Woldar, A characterization of the components of the graphs , Discrete Math. 157 (1996) 271–283.
- [12] F. Lazebnik and A.J. Woldar, General properties of some families of graphs defined by systems of equations, J. Graph Theory 38 (2001) no.2, 65–86.
- [13] W.-C. W. Li, M. Lu and C. Wang, Recent developments in low-density parity-check codes, in: Coding and Cryptology, Lecture Notes in Comput. Sci. 5557 (Springer, Berlin, 2009), pp.107–123.
- [14] R. Lidl and H. Niederreiter, Finite Fields, 2nd ed., Encyclopedia of Mathematics and its Applications (Camb. Univ. Press, Cambridge, 1997).
- [15] A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) no. 3, 261–277.
- [16] G.A. Margulis, Explicit constructions of expanders, Prob. Pered. Inform. 9 (1973) no. 4, 71–80.
- [17] G.A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators, Prob. Inform. Trans. 24 (1988) no. 1, 39–46.
- [18] B.R. McDonald, Finite Rings with Identity (Marcel Dekker, New York, 1974).
- [19] S. Reichard, personal communication with F. Lazebnik, 2001.
- [20] A. Thomason, personal communication with F. Lazebnik, 2002.
- [21] V.A. Ustimenko, Ramanujan graphs of a given degree, Dopov. Nats. Akad. Nauk Ukr. Mat. Prirodozn. Tekh. Nauki (1997) no. 6, 37–41.
- [22] V.A. Ustimenko, On a group theoretical construction of expanding graphs, Algebra Discrete Math. (2003), no. 3, 102–109. MR2048644 (reviewer: Y. Glasner)
- [23] L. Washington, Introduction to Cyclotomic Fields, 2nd ed. (Springer, New York, 1997).
- [24] A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. U.S.A. 34 (1948) 47–62.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. Alon, O. Schwartz and A. Shapira, An elementary-construction of constant-degree expanders, Combin. Probab. Comput. 17 (2008) 319–327.
- 2[2] L. Babai, Spectra of Cayley graphs, J. Combinatorial Theory Ser. B 27 (1979) 180–189.
- 3[3] A.E. Brouwer and W.H. Haemers, Spectra of Graphs (Springer, New York, 2012).
- 4[4] S.M. Cioabă, F. Lazebnik and W. Li, On the spectrum of Wenger graphs, J. Combin. Theory Ser. B 107 (2014) 132–139.
- 5[5] P. Diaconis and M. Shahshahani, Generating random permutations from random transpositions, Z. Wahrsch. Verw. Gebiete 57 (1981) no. 2, 159–179.
- 6[6] C.D. Godsil and G. Royle, Algebraic Graph Theory (Springer, New York, 2001).
- 7[7] I.M. Isaacs, Character Theory of Finite Groups (Academic Press, New York, 1978).
- 8[8] P.V. Kumar, T. Helleseth and A.R. Calderbank, An upper bound for Weil exponential sums over Galois rings and applications, IEEE Trans. Inf. Theory (2) 41 (1995) 456–468.
