Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry

2007

352 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/22922a9724814e905b122e94ea28e5485ae80bb4

Citations in the corpus

• The Gromov–Hausdorff distance between spheres (2021, methodology): “These results are instrumental for proving Theorem B below; see §5 and Appendix A for details and for a concise proof of the main theorem from [11] (following a strategy outlined by Matoušek in [22]).”
• Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story (2016, methodology): “Lectures on Topological Methods in Combinatorics and Geometry” [36] is an inspiring introduction to the use of equivariant methods in Discrete Geometry.”
• Large Networks and Graph Limits (2012, background): “41n with high probability (McKay [1982], see also Hladky [2006]), and we get that (Gn) is not even (4/5, 3)-hyperfinite.”
• Counting Graph Homomorphisms (2006, background): “See the book of Matoušek [51], and also the recent papers of Babson and Kozlov [5, 6].”
• The endpoint case of the Bennett–Carbery–Tao multilinear Kakeya conjecture (2008, background): “Moreover, each cylinder Tj,a runs nearly parallel to the xj-axis.”