EXPANDER GRAPHS IN PURE AND APPLIED MATHEMATICS

被引：103
|
作者：
Lubotzky, Alexander [1 ]
机构：
[1] Hebrew Univ Jerusalem, Einstein Inst Math, IL-91904 Jerusalem, Israel
来源：
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY | 2012年 / 49卷 / 01期
基金：
美国国家科学基金会;
关键词：
ZARISKI-DENSE SUBGROUPS; FINITE SIMPLE-GROUPS; EXPLICIT CONSTRUCTIONS; RAMANUJAN GRAPHS; RANDOM-WALKS; CONGRUENCE SUBGROUPS; STRONG APPROXIMATION; UNIVERSAL LATTICES; DECISION-PROBLEMS; CASE COMPLEXITY;
D O I：
10.1090/S0273-0979-2011-01359-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms, and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry, and more. This expository article describes their constructions and various applications in pure and applied mathematics.
引用
收藏
页码：113 / 162
页数：50
相关论文
共 50 条
12345