相关论文: Self-intersections of arcs on a pair of pants
In this paper1 , we use the coding developed by R. Bowen and C. Series to compute the number of self-intersections of a closed geodesic on a pair of pants. We give lower and upper bounds on the number of self-intersections of a closed…
We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
We give an explicit formula for the self-intersection number of negative curves on Fermat surfaces. The formula offers us hints to either prove or disprove the Bounded Negativity Conjecture for the Fermat surfaces.
We obtain a sharp bound on the number of self-intersections of a closed planar curve with trigonometric parameterization. Moreover, we show that a generic curve of this form is normal in the sense of Whitney.
We study the asymptotic behaviour of the number of self-intersections of a trajectory of a periodic planar Lorentz process with strictly convex obstacles and finite horizon. We give precise estimates for its expectation and its variance. As…
We study the geometric and combinatorial effect of smoothing an intersection point in a collection of arcs or curves on a surface. We prove that all taut arcs with fixed endpoints and all taut 1-manifolds with at least two non-disjoint…
In this paper, we introduce numerical cohomology for arithmetic surfaces, which leads to an absolute version of arithmetic Riemann-Roch formula. As an application, we derive an upper bound for the self-intersection number of relative…
In an orientable surface with boundary, free homotopy classes of curves on surfaces are in one to one correspondence with cyclic reduced words in a set of standard generators of the fundamental group. The combinatorial length of a class is…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
We investigate the terms arising in an identity for hyperbolic surfaces proved by Luo and Tan, namely showing that they vary monotonically in terms of lengths and that they verify certain convexity properties. Using these properties, we…
We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…
We study the arithmetic self-intersection number of the dualizing sheaf on arithmetic surfaces with respect to morphisms of a particular kind. We obtain upper bounds for the arithmetic self-intersection number of the dualizing sheaf on…
This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
The minimum number of self-intersection points for members of a free homotopy class of curves on the punctured torus is bounded above in terms of the number L of letters required for a minimal description of the class in terms of the…
We give several algorithms addressing computations of intersections of conjugate subgroups.