Papers
Topics
Authors
Recent
Search
2000 character limit reached

Crossing number of curves on surfaces

Published 8 Mar 2024 in math.GT | (2403.05148v1)

Abstract: We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing number of up to 12 curves on a surface of genus 2 and prove that minimising systems are unique up to homeomorphisms of the surface and isotopies of curves.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. A. Bondy and U.S.R. Murty. Graph Theory. Graduate Texts in Mathematics. Springer London, 2008.
  2. Max Dehn. Die Gruppe der Abbildungsklassen: Das arithmetische Feld auf Flächen. Acta mathematica, 69:135–206, 1938.
  3. Thurston’s Work on Surfaces (MN-48). Mathematical Notes - Princeton University Press. Princeton University Press, 2012.
  4. A Primer on Mapping Class Groups. Princeton Mathematical Series. Princeton University Press, 2012.
  5. Joshua Evan Greene. On curves intersecting at most once. arXiv preprint arXiv:1807.05658, 2018.
  6. Crossing lemmas for curves on surfaces, 2024. In preparation.
  7. Maryam Mirzakhani. Growth of the number of simple closed geodesics on hyperbolic surfaces. Annals of mathematics, 168(1):97–125, 2008.
  8. Multiplicities of simple closed geodesics and hypersurfaces in Teichmüller space. Geometry & Topology, 12(4):1883–1919, 2008.
  9. Topological designs. Geometriae Dedicata, 168(1):221–233, February 2013.
  10. Hugo Parlier. Kissing numbers for surfaces. Journal of Topology, 6(3):777–791, April 2013.
  11. Paul Schmutz. Riemann surfaces with shortest geodesic of maximal length. Geometric & Functional Analysis GAFA, 3(6):564–631, 1993.
  12. Paul Schmutz. Systoles on Riemann surfaces. manuscripta mathematica, 85(1):429–447, 1994.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.