<p>The main goal of this paper is to investigate the minimal size of families of curves on surfaces with the following property: a family of simple closed curves Γ on a surface realizes all types of pants decompositions if for any pants decomposition of the surface, there exists a homeomorphism sending it to a subset of the curves in Γ. The study of such universal families of curves is motivated by questions on graph embeddings, joint crossing numbers and finding an elusive center of moduli space. In the case of surfaces without punctures, we provide an exponential upper bound and a superlinear lower bound on the minimal size of a family of curves that realizes all types of pants decompositions. We also provide upper and lower bounds in the case of surfaces with punctures which we can consider labelled or unlabelled, and investigate a similar concept of universality for triangulations of polygons, where we provide bounds which are tight up to logarithmic factors.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Universal families of arcs and curves on surfaces

  • Niloufar Fuladi,
  • Arnaud de Mesmay,
  • Hugo Parlier

摘要

The main goal of this paper is to investigate the minimal size of families of curves on surfaces with the following property: a family of simple closed curves Γ on a surface realizes all types of pants decompositions if for any pants decomposition of the surface, there exists a homeomorphism sending it to a subset of the curves in Γ. The study of such universal families of curves is motivated by questions on graph embeddings, joint crossing numbers and finding an elusive center of moduli space. In the case of surfaces without punctures, we provide an exponential upper bound and a superlinear lower bound on the minimal size of a family of curves that realizes all types of pants decompositions. We also provide upper and lower bounds in the case of surfaces with punctures which we can consider labelled or unlabelled, and investigate a similar concept of universality for triangulations of polygons, where we provide bounds which are tight up to logarithmic factors.