English
Related papers

Related papers: Intersection numbers in the curve graph with a uni…

200 papers

We prove that for every integer $t\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\chi$-bounded. This is essentially the strongest…

Combinatorics · Mathematics 2017-10-05 Alexandre Rok , Bartosz Walczak

A curve \gamma in the plane is t-monotone if its interior has at most t-1 vertical tangent points. A family of t-monotone curves F is \emph{simple} if any two members intersect at most once. It is shown that if F is a simple family of n…

Combinatorics · Mathematics 2013-07-10 Andrew Suk

Near a singular point of a surface or a curve, geometric invariants diverge in general, and the orders of diverge, in particular the boundedness about these invariants represent geometry of the surface and the curve. In this paper, we study…

Differential Geometry · Mathematics 2024-10-14 Luciana F. Martins , Kentaro Saji , Samuel P. dos Santos , Keisuke Teramoto

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

Geometric Topology · Mathematics 2016-05-24 Patricia Cahn , Federica Fanoni , Bram Petri

The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…

Computational Geometry · Computer Science 2019-11-28 Vincent Despré , Francis Lazarus

Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…

Geometric Topology · Mathematics 2014-10-01 Max Neumann-Coto

A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$…

Combinatorics · Mathematics 2025-11-04 Daniel Cizma , Nati Linial

We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…

Functional Analysis · Mathematics 2018-01-30 Daniel Lenz , Marcel Schmidt , Peter Stollmann

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

Geometric Topology · Mathematics 2016-11-16 Moira Chas , Siddhartha Gadgil

We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…

Geometric Topology · Mathematics 2013-05-16 Richard C. H. Webb

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

Computational Geometry · Computer Science 2026-05-12 Timothy M. Chan , Hsien-Chih Chang , Jie Gao , Sándor Kisfaludi-Bak , Hung Le , Da Wei Zheng

Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we…

Geometric Topology · Mathematics 2016-09-02 Viveka Erlandsson , Hugo Parlier

The CD inequalities and CDE inequalities are useful in the estimate of curvature on graphs. This article is based on the ufinite graph with large girth, and finally concludes some curvature estimate in CD and CDE.

Combinatorics · Mathematics 2016-09-29 Yijin Gao

Let X be a complete hyperbolic surface of finite area. We establish that the intersection points of closed geodesics with length <T are equidistributed on X as T goes to infinity.

Geometric Topology · Mathematics 2025-10-01 Tina Torkaman

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

Geometric Topology · Mathematics 2015-11-03 Yohsuke Watanabe

Curves in ${\mathbb R}^n$ for which the ratios between two consecutive curvatures are constant are characterized by the fact that their tangent indicatrix is a geodesic in a flat torus. For $n= 3,4$, spherical curves of this kind are also…

Differential Geometry · Mathematics 2007-05-23 J. Monterde

A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…

Geophysics · Physics 2024-04-02 Charles F. F. Karney

We study the order of lengths of closed geodesics on hyperbolic surfaces. Our first main result is that the order of lengths of curves determine a point in Teichm\"uller space. In an opposite direction, we identify classes of curves whose…

Geometric Topology · Mathematics 2025-06-10 Hugo Parlier , Hanh Vo , Binbin Xu

In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given…

Differential Geometry · Mathematics 2016-01-19 Mohamd Saleem Lone , O. Aleessio , Mohammad Jamali , Mohammad Hasan Shahid

In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…

Artificial Intelligence · Computer Science 2011-10-12 R. H. C. Yap , Y. Zhang