EXISTENCE AND EXPLICIT CONSTRUCTIONS OF Q-Q(1 REGULAR RAMANUJAN GRAPHS FOR EVERY PRIME POWER)

Authors
Citation
M. Morgenstern, EXISTENCE AND EXPLICIT CONSTRUCTIONS OF Q-Q(1 REGULAR RAMANUJAN GRAPHS FOR EVERY PRIME POWER), J COMB TH B, 62(1), 1994, pp. 44-62
Citations number
26
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956 → ACNP
Volume
62
Issue
1
Year of publication
1994
Pages
44 - 62
Database
ISI
SICI code
0095-8956(1994)62:1<44:EAECOQ>2.0.ZU;2-#
Abstract
For any prime power q, we give explicit constructions for many infinit e linear families of q + 1 regular Ramanujan graphs. This partially so lves a problem that was raised by A. Lubotzky, R. Phillips, and P. Sar nak. They gave the same results as here, but only for q being prime an d not equal to two, and raised the question of the existence and expli cit construction of such graphs for other degrees of regularity. Moreo ver, our construction removes the nondeterministic part of finding lar ge prime numbers, which for some applications may appear in their cons truction. Our graphs are given as Cayley graphs of PGL(2) or PSL(2) ov er finite fields, with respect to very simple generators. They also sa tisfy all other extremal combinatorial properties that those of Lubots ky, Phillips, and Sarnak do. (C) 1994 Academic Press, Inc.