Expander graphs in pure and applied mathematics

Alexander Lubotzky

doi:https://doi.org/10.1090/S0273-0979-2011-01359-3

Expander graphs in pure and applied mathematics

Alexander Lubotzky

Einstein Institute of Mathematics

The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	113-162
Number of pages	50
Journal	Bulletin of the American Mathematical Society
Volume	49
Issue number	1
DOIs	https://doi.org/10.1090/S0273-0979-2011-01359-3
State	Published - 2012

All Science Journal Classification (ASJC) codes

General Mathematics
Applied Mathematics

Access to Document

https://doi.org/10.1090/S0273-0979-2011-01359-3

Cite this

@article{ec70df16f7954980869b477c04b31bd5,

title = "Expander graphs in pure and applied mathematics",

abstract = "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.",

author = "Alexander Lubotzky",

year = "2012",

doi = "https://doi.org/10.1090/S0273-0979-2011-01359-3",

language = "الإنجليزيّة",

volume = "49",

pages = "113--162",

journal = "Bulletin of the American Mathematical Society",

issn = "0273-0979",

publisher = "American Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Expander graphs in pure and applied mathematics

AU - Lubotzky, Alexander

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84855763533&partnerID=8YFLogxK

U2 - https://doi.org/10.1090/S0273-0979-2011-01359-3

DO - https://doi.org/10.1090/S0273-0979-2011-01359-3

M3 - مقالة

SN - 0273-0979

VL - 49

SP - 113

EP - 162

JO - Bulletin of the American Mathematical Society

JF - Bulletin of the American Mathematical Society

IS - 1

ER -

Expander graphs in pure and applied mathematics

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this