Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Filling with separating curves

    A pair (α,β) of simple closed curves on a closed and orientable surface Sg of genus g is called a filling pair if the complement is a disjoint union of topological disks. If α is separating, then we call it as separating filling pair. In this paper, we find a necessary and sufficient condition for the existence of a separating filling pair on Sg with exactly two complementary disks. We study the combinatorics of the action of the mapping class group Mod(Sg) on the set of such filling pairs. Furthermore, we construct a Morse function g on the moduli space g which, for a given hyperbolic surface X, outputs the length of the shortest such filling pair with respect to the metric in X. We show that the cardinality of the set of global minima of the function g is the same as the number of Mod(Sg)-orbits of such filling pairs.

  • articleNo Access

    Graphs of systoles on hyperbolic surfaces

    Given a hyperbolic surface, the set of all closed geodesics whose length is minimal forms a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface (we call these admissible).

    There is a natural necessary condition on such graphs, which we call combinatorial admissibility. Our first main result is that this condition is also sufficient.

    It follows that a sub-graph of an admissible graph is admissible. Our second major result is that there are infinitely many minimal non-admissible fat graphs (in contrast, for instance, to the classical result that there are only two minimal non-planar graphs).

  • chapterNo Access

    On Weil-Petersson Volumes and Geometry of Random Hyperbolic Surfaces

    This paper investigates the geometric properties of random hyperbolic surfaces with respect to the Weil-Petersson measure. We describe the relationship between the behavior of lengths of simple closed geodesics on a hyperbolic surface and properties of the moduli space of such surfaces. First, we study the asymptotic behavior of Weil-Petersson volumes of the moduli spaces of hyperbolic surfaces of genus g as g → ∞. Then we apply these asymptotic estimates to study the geometric properties of random hyperbolic surfaces, such as the length of the shortest simple closed geodesic of a given combinatorial type.