A new family of Cayley expanders (?)

DOI10.1145/1007352.1007423MaRDI QIDQ3580989zbMATH OpenOpenAlexFDO

Authors Eyal Rozenman, Aner Shalev, A. Wigderson

Publication date 15 August 2010

Published in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1007352.1007423

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Cited in

(9)

• Symmetric groups and expander graphs.
• Nonembeddability theorems via Fourier analysis
• Simple permutations mix even better
• Expander graphs and their applications
• Symmetric groups and expanders
• Symmetric LDPC codes and local testing
• Symmetric LDPC codes and local testing
• On the spectra of prefix-reversal graphs
• Eccentric connectivity polynomial of Cartesian product of unitary Cayley graph and some standard graphs

This page was built for publication: A new family of Cayley expanders (?)

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