Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
✍ Scribed by M. Morgenstern
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 691 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
For any prime power (q), we give explicit constructions for many infinite linear families of (q+1) regular Ramanujan graphs. This partially solves a problem that was raised by A. Lubotzky, R. Phillips, and P. Sarnak. They gave the same results as here, but only for (q) being prime and not equal to two, and raised the question of the existence and explicit construction of such graphs for other degrees of regularity. Moreover, our construction removes the nondeterministic part of finding large prime numbers, which for some applications may appear in their construction. Our graphs are given as Cayley graphs of (P G L_{2}) or (P S L_{2}) over finite fields, with respect to very simple generators. They also satisfy all other extremal combinatorial properties that those of Lubotsky, Phillips, and Sarnak do. C 1994 Academic Press, Inc.