Advertisement

On Loops Intersecting at Most Once

  • Joshua Evan GreeneEmail author
Article
  • 26 Downloads

Abstract

We prove that on a closed, orientable surface of genus g, the maximum cardinality of a set of simple loops with the property that no two are homotopic or intersect in more than k points grows as a function of g like \(g^{k+1}\), up to a factor of \(\log g\). The proof of the upper bound uses arguments from probabilistic combinatorics and a theorem of Scott related to the fact that surface groups are LERF.

Mathematics Subject Classification

57M15 05C62 05D40 

Notes

Acknowledgements

I thank Ravi Boppana, Jacob Caudell, Jonah Gaster, and Larry Guth for fun and helpful conversations. In particular, Larry laid the groundwork for constructing the “enemy graphs" of Theorem 8. I thank Dan Margalit for drawing my attention to [SS00] and the referee for unpacking the proof of Lemma 10. This work was supported by NSF CAREER Award DMS-1455132.

References

  1. ABG17.
    Tarik Aougab, Ian Biringer, and Jonah Gaster. Packing curves on surfaces with few intersections. Int. Math. Res. Not. IMRN, (2017), rnx270.Google Scholar
  2. Aou14.
    Tarik Aougab. Constructing large \(k\)-systems on surfaces. Topology Appl., 176 (2014), 1–9Google Scholar
  3. AS08.
    Noga Alon and Joel H. Spencer. The Probabilistic Method, third ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, (2008).CrossRefGoogle Scholar
  4. BGL15.
    Kenneth L. Baker, Cameron Gordon, and John Luecke. Bridge number, Heegaard genus and non-integral Dehn surgery. Trans. Amer. Math. Soc., 367(8) (2015), 5753–5830MathSciNetCrossRefGoogle Scholar
  5. Gut16.
    Larry Guth. Polynomial methods in combinatorics, University Lecture Series, vol. 64, American Mathematical Society, Providence, RI, (2016).CrossRefGoogle Scholar
  6. Her75.
    I.N. Herstein, Topics in algebra, second ed., (1975).Google Scholar
  7. JMM96.
    M. Juvan, A. Malnič, and B. Mohar, Systems of curves on surfaces. J. Combin. Theory Ser. B, 68(1) (1996), 7–22MathSciNetCrossRefGoogle Scholar
  8. Mil99.
    G.A. Miller, On the commutators of a given group Bull. Amer. Math. Soc., 6(3) (1899), 105–109CrossRefGoogle Scholar
  9. MRT14.
    Justin Malestein, Igor Rivin, and Louis Theran, Topological designs. Geom. Dedicata, 168 (2014), 221–233MathSciNetCrossRefGoogle Scholar
  10. MSS15.
    Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava. Interlacing families I: Bipartite Ramanujan graphs of all degrees. Ann. of Math. (2), 182(1) (2015), 307–325MathSciNetCrossRefGoogle Scholar
  11. Prz15.
    Piotr Przytycki, Arcs intersecting at most once. Geom. Funct. Anal., 25(2) (2015), 658–670MathSciNetCrossRefGoogle Scholar
  12. Sco78.
    Peter Scott, Subgroups of surface groups are almost geometric. J. London Math. Soc. (2), 17(3) (1978), 555–565MathSciNetCrossRefGoogle Scholar
  13. SS00.
    Paul Schmutz Schaller, Mapping class groups of hyperbolic surfaces and automorphism groups of graphs. Compositio Math., 122(3) (2000), 243–260MathSciNetCrossRefGoogle Scholar
  14. Szé97.
    László A. Székely, Crossing numbers and hard Erdös problems in discrete geometry. Combin. Probab. Comput., 6(3) (1997), 353–358MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of MathematicsBoston CollegeChestnut HillUSA

Personalised recommendations