Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Gekeler, Udo Nonnengardt (1995)
FUNDAMENTAL DOMAINS OF SOME ARITHMETIC GROUPS OVER FUNCTION FIELDSInternational Journal of Mathematics, 06
Moshe Morgenstern (1995)
Natural bounded concentratorsCombinatorica, 15
W. Li (1978)
On modular functions in characteristic $p$Transactions of the American Mathematical Society, 246
S. Gelbart (1975)
Automorphic Forms on Adele Groups. (AM-83)
S. Gelbart (1975)
Automorphic forms on Adele groups
Bruno Schoeneberg (1974)
Elliptic Modular Functions
Jean-Pierre Serre (1997)
Répartition asymptotique des valeurs propres de l’opérateur de Hecke _Journal of the American Mathematical Society, 10
I. Efrat (1987)
Eisenstein series and Cartan groupsIllinois Journal of Mathematics, 31
V. Drinfel'd (1988)
The proof of peterson's conjecture for GL(2) over a global field of characteristic pFunctional Analysis and Its Applications, 22
Moshe Morgenstern (1994)
Ramanujan DiagramsSIAM J. Discret. Math., 7
D. Hejhal (1983)
The Selberg trace formula for PSL (2, IR)
K. Feng, W. Li (1996)
Spectra of Hypergraphs and ApplicationsJournal of Number Theory, 60
A. Terras (1999)
Fourier Analysis on Finite Groups and Applications: Index
I. Efrat, P. Sarnak (1985)
The determinant of the Eisenstein matrix and Hilbert class fieldsTransactions of the American Mathematical Society, 290
B. McKay (1981)
The expected eigenvalue distribution of a large regular graphLinear Algebra and its Applications, 40
I. Efrat (1990)
Spectral deformations of automorphic functions over graphs of groupsInventiones mathematicae, 102
N. Wormald (1981)
The asymptotic distribution of short cycles in random regular graphsJ. Comb. Theory, Ser. B, 31
Abstract. Let q be a principal congruence subgroups of PGL2Y Fq t, then it is known that qnX is an in®nite Ramanujan diagram, where X is the q 1-regular tree. We obtain the limit distributions of eigenvalues of the adjacency operator for qnX . The spectral density of X and the Sato-Tate measure appear as the limit distributions. 2000 Mathematics Subject Classi®cation: 11F72, 11F03; 05C25, 58J50. 1 Introduction A Ramanujan graph is de®ned as a k-regular ®nite graph whose nontrivial eigenp values of the adjacency operator have absolute values bounded by 2 k À 1. Such eigenvalue bounds force graphs to have high magni®cations and small diameters, hence these graphs give good communication networks. They also have important applications in computer science. However, it is not easy to determine whether a given graph is Ramanujan, especially when the size of a graph is large. So it is a dif®cult task to give explicit constructions of an in®nite family of Ramanujan graphs whose sizes increase. The ®rst construction of an in®nite family of Ramanujan graphs were given by Lubotzky, Phillips and Sarnak [LPS] and Margulis [Ma]. It is based on the arithmetic of quaternion algebras and the Ramanujan conjecture
Forum Mathematicum – de Gruyter
Published: Jul 29, 2002
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.