An Algorithm for Simple Curves on Surfaces
From MaRDI portal
algorithm for simple curves on surfacesgeodesics in the universal coverNielsen boundary expansionsword representing a simple curve
Cited in
(23)- Asymptotic distribution of closed geodesics
- Diophantine approximation on hyperbolic Riemann surfaces
- Traces, lengths, and simplicity for loops on surfaces
- Algebraic linearity for an automorphism of a surface group
- On a problem of A. Weil
- A note on the McShane's identity for Hecke groups
- Effective counting of simple closed geodesics on hyperbolic surfaces
- Geometric intersections of loops on surfaces
- Finding simple curves in surface covers is undecidable
- Estimating the self-intersection number of closed curves on surface by knot method
- Incompressible solvable representations of surface groups
- Statistical regularities of self-intersection counts for geodesics on negatively curved surfaces
- Algorithmic aspects of branched coverings. II/V: Sphere bisets and decidability of Thurston equivalence
- Algebraic characterization of simple closed curves via Turaev's cobracket
- A combinatorial algorithm for visualizing representatives with minimal self-intersection
- Geodesic flows, interval maps, and symbolic dynamics
- The fundamental group of the punctured Klein bottle and the simple loop conjecture
- An effective algebraic detection of the Nielsen-Thurston classification of mapping classes
- Geodesic planes in a geometrically finite end and the halo of a measured lamination
- Combinatorial k-systoles on a punctured torus and a pair of pants
- Self-intersections of arcs on a pair of pants
- Making multicurves cross minimally on surfaces
- Integrable systems from Poisson reductions of generalized Hamiltonian torus actions
This page was built for publication: An Algorithm for Simple Curves on Surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744988)
