NUMBER-THEORETIC CONSTRUCTIONS OF RAMANUJAN GRAPHS

被引：0
|
作者：
LI, WCW [1 ]
机构：
[1] PENN STATE UNIV,DEPT MATH,UNIVERSITY PK,PA 16802
来源：
ASTERISQUE | 1995年 / 228期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A Ramanujan graph is a k-regular graph with nontrivial eigenvalues bounded by 2 root k - 1. In this article we review three explicit constructions of Ramanujan graphs using results from automorphic forms, representation theory of GL(2) over finite fields, and character sum estimates derived from the Riemann Hypothesis for curves over finite fields.
引用
收藏
页码：101 / 120
页数：20
相关论文
共 50 条
12345