Expander graphs in pure and applied mathematics

From MaRDI portal
Revision as of 21:51, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3109810

DOI10.1090/S0273-0979-2011-01359-3zbMATH Open1232.05194arXiv1105.2389OpenAlexW2005644627WikidataQ105978537 ScholiaQ105978537MaRDI QIDQ3109810FDOQ3109810

Alexander Lubotzky

Publication date: 26 January 2012

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1105.2389





Cites Work


Cited In (93)






This page was built for publication: Expander graphs in pure and applied mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109810)