International audienceWe study filling sets of simple closed curves on punctured surfaces. In particular we study lower bounds on the cardinality of sets of curves that fill and that pairwise intersect at most k times on surfaces with given genus and number of punctures. We are able to establish orders of growth for even k and show that for odd k the orders of growth behave differently. We also study the corresponding questions when one requires that the curves be represented as systoles on hyperbolic complete finite area surfaces
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
49 pages, 11 (mostly hand-drawn) figuresInternational audienceLet $\Sigma$ be a hyperbolic surface. ...
Consider a set of simple closed curves on a surface of genus g which fill the surface and which pair...
Abstract. We show that the asymptotic growth rate for the minimal cardinality of a set of simple clo...
AbstractWe show that the asymptotic growth rate for the minimal cardinality of a set of simple close...
AbstractWe show that the asymptotic growth rate for the minimal cardinality of a set of simple close...
Abstract. Given a surface Sg,n there is a map sys: Tg,n → Cg,n where Tg,n is the Teichmüller space ...
Abstract. Let S g denote the closed orientable surface of genus g. We construct exponentially many m...
Filling a curve with an oriented surface can sometimes be “cheaper by the dozen”. For example, L. C....
Abstract. We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maxi...
Let F-g denote a closed oriented surface of genus g. A set of simple closed curves is called a filli...
Abstract. The so-called kissing number for hyperbolic surfaces is the maximum number of homotopicall...
Let F-g denote a closed oriented surface of genus g. A set of simple closed curves is called a filli...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
49 pages, 11 (mostly hand-drawn) figuresInternational audienceLet $\Sigma$ be a hyperbolic surface. ...
Consider a set of simple closed curves on a surface of genus g which fill the surface and which pair...
Abstract. We show that the asymptotic growth rate for the minimal cardinality of a set of simple clo...
AbstractWe show that the asymptotic growth rate for the minimal cardinality of a set of simple close...
AbstractWe show that the asymptotic growth rate for the minimal cardinality of a set of simple close...
Abstract. Given a surface Sg,n there is a map sys: Tg,n → Cg,n where Tg,n is the Teichmüller space ...
Abstract. Let S g denote the closed orientable surface of genus g. We construct exponentially many m...
Filling a curve with an oriented surface can sometimes be “cheaper by the dozen”. For example, L. C....
Abstract. We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maxi...
Let F-g denote a closed oriented surface of genus g. A set of simple closed curves is called a filli...
Abstract. The so-called kissing number for hyperbolic surfaces is the maximum number of homotopicall...
Let F-g denote a closed oriented surface of genus g. A set of simple closed curves is called a filli...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
49 pages, 11 (mostly hand-drawn) figuresInternational audienceLet $\Sigma$ be a hyperbolic surface. ...