Short loop decompositions of surfaces and the geometry of Jacobians

preprint2010arXivOpen access

Abstract

Given a Riemannian surface, we consider a naturally embedded graph which captures part of the topology and geometry of the surface. By studying this graph, we obtain results in three different directions. First, we find bounds on the lengths of homologically independent curves on closed Riemannian surfaces. As a consequence, we show that for any λ∈(0,1)λ\in (0,1) there exists a constant CλC_λ such that every closed Riemannian surface of genus gg whose area is normalized at 4π(g−1)4π(g-1) has at least [λg][λg] homologically independent loops of length at most Cλlog⁡(g)C_λ\log(g). This result extends Gromov's asymptotic log⁡(g)\log(g) bound on the homological systole of genus gg surfaces. We construct hyperbolic surfaces showing that our general result is sharp. We also extend the upper bound obtained by P. Buser and P. Sarnak on the minimal norm of nonzero period lattice vectors of Riemann surfaces %systole of Jacobians of Riemann surfaces in their geometric approach of the Schottky problem to almost gg homologically independent vectors. Then, we consider the lengths of pants decompositions on complete Riemannian surfaces in connexion with Bers' constant and its generalizations. In particular, we show that a complete noncompact Riemannian surface of genus gg with nn ends and area normalized to 4π(g+n2−1)4π(g+\frac{n}{2}-1) admits a pants decomposition whose total length (sum of the lengths) does not exceed Cg nlog⁡(n+1)C_g \, n \log (n+1) for some constant CgC_g depending only on the genus. Finally, we obtain a lower bound on the systolic area of finitely presentable nontrivial groups with no free factor isomorphic to Z\Z in terms of its first Betti number. The asymptotic behavior of this lower bound is optimal.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.