Subsets of Cayley Graphs that Induce Many Edges

by Timothy Gowers and Oliver Janzer

Theory of Computing, Volume 15(20), pp. 1-29, 2019

Bibliography with links to cited articles

[1]   Boaz Barak, Pravesh K. Kothari, and David Steurer: Small-set expansion in Shortcode Graph and the 2-to-2 Conjecture, 2019. [doi:10.4230/LIPIcs.ITCS.2019.9, arXiv:1804.08662]

[2]   Fan Chung and Linyuan Lu: Concentration inequalities and martingale inequalities: A survey. Internet Mathematics, 3(1):79–127, 2006. Available at Project Euclid.

[3]   Ben Green: The asymmetric Balog-Szemer├ędi-Gowers theorem. Lecture notes.

[4]   Oliver Janzer: Low analytic rank implies low partition rank for tensors, 2018. [arXiv:1809.10931]

[5]   Oliver Janzer: Polynomial bound for the partition rank vs the analytic rank of tensors, 2019. [arXiv:1902.11207]

[6]   Subhash Khot: On the power of unique 2-prover 1-round games. In Proc. 34th STOC, pp. 767–775. ACM Press, 2002. [doi:10.1145/509907.510017]

[7]   Subhash Khot, Dor Minzer, and Muli Safra: Pseudorandom sets in Grassmann graph have near-perfect expansion. In Proc. 59th FOCS, pp. 592–601. IEEE Comp. Soc. Press, 2018. [doi:10.1109/FOCS.2018.00062]

[8]   Shachar Lovett: The analytic rank of tensors and its applications. Discrete Analysis, 2019:7, 10 pp. [doi:10.19086/da.8654, arXiv:1806.09179v5]

[9]   Terence Tao and Van H. Vu: Additive Combinatorics. Cambridge Univ. Press, 2006. [doi:10.1017/CBO9780511755149]