Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

275481108 · Jun 202019922001200920172026
48 results for essential arcs

Study on shortest arcs on hyperbolic surfaces with boundary.

problem Characterize and maximize the length of shortest essential arcs on hyperbolic surfaces with geodesic boundaries.
method Analyze hyperbolic surfaces with multiple boundary components, construct surfaces with large orthosystole, and compare growth rates.
result Orthosystole grows at the same rate as Bavard's upper bound as the genus increases.

A classical combinatorial fact is that the simplicial complex consisting of disjointly embedded chords in a convex planar polygon is a sphere. For any surface F with non-empty boundary, there is an analogous complex Arc(F) consisting of suitable equivalence classes of arcs in F connecting its boundary components. The m…

2004-10-28abs ↗pdf ↗

The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least 5pi/3; examples show that distortion under 7.16 suffices to build a trefoil kno…

2004-09-22abs ↗pdf ↗

Proves constant scalar curvature Kähler metrics are very general.

problem Existence of constant scalar curvature Kähler metrics on smooth polarized varieties.
method Combining uniform arc K-stability and algebraic properties in families.
result The constant scalar curvature Kähler locus is very general.

We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic estimate in |chi| for a set of curves pairwise intersecting at most once on a cl…

2014-02-07abs ↗pdf ↗

The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial improvement on previous results. The proof depends essentially on writing links i…

2002-10-16abs ↗pdf ↗

Uniform Closure Method and Bayes classifier perform similarly in classifying open knots.

problem Classifying knots in open macromolecular chains.
method Used the Bayes MAP classifier and compared it to the Uniform Closure Method.
result Both methods have comparable accuracy and positive predictive value.

We study strip deformations of convex cocompact hyperbolic surfaces, defined by inserting hyperbolic strips along a collection of disjoint geodesic arcs properly embedded in the surface. We prove that any deformation of the surface that uniformly lengthens all closed geodesics can be realized as a strip deformation, in…

2014-07-21abs ↗pdf ↗

Two natural questions are answered in the negative: (1) If a space has the property that small nulhomotopic loops bound small nulhomotopies, then are loops which are limits of nulhomotopic loops themselves nulhomotopic? (2) Can adding arcs to a space cause an essential curve to become nulhomotopic? The answer to the fi…

2007-12-11abs ↗pdf ↗

We define a laminar branched surface to be a branched surface satisfying the following conditions: (1) Its horizontal boundary is incompressible; (2) there is no monogon; (3) there is no Reeb component; (4) there is no sink disk (after eliminating trivial bubbles in the branched surface). The first three conditions are…

2002-03-31abs ↗pdf ↗

We show that mapping class groups associated to all types of real algebraic curves are virtual duality groups. We also deduce some results about the orbifold homotopy groups of the moduli spaces of real algebraic curves. We achieve these results by defining a new complex associated to a not necessarily orientable surfa…

2018-01-18abs ↗pdf ↗

Checkerboard surfaces in alternating link complements are used frequently to determine information about the link. However, when many crossings are added to a single twist region of a link diagram, the geometry of the link complement stabilizes (approaches a geometric limit), but a corresponding checkerboard surface in…

2014-10-23abs ↗pdf ↗

In this paper, we formulate a new local move on virtual knot diagram, called arc shift move. Further, we extend it to another local move called region arc shift defined on a region of a virtual knot diagram. We establish that these arc shift and region arc shift moves are unknotting operations by showing that any virtu…

2018-08-13abs ↗pdf ↗

It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the knotting probability of an arc diagram is defined as an invariant under isomorphic …

2019-07-24abs ↗pdf ↗

The study of smoothing arcs and curves on surfaces, proving tautness and arc length spectrum properties.

problem Analyzing the geometric and combinatorial effects of smoothing intersections in arcs or curves.
method Geometric and combinatorial analysis, proving tautness and arc length spectrum properties.
result Shortest arcs with self-intersections have exactly or at most one more self-intersection than the self-intersection number.

Minimal grid diagrams for 15,735 knots with 14 crossings and arc index 14.

problem Representing prime knots with 14 crossings and specific arc indices using grid diagrams.
method Enumerated all prime knots with 14 crossings, categorized by arc index, and found minimal grid diagrams for those with arc index 14.
result 8,027 knots with arc index 13 and 15,735 knots with arc index 14 were represented by minimal grid diagrams.

As a supplement to the authors' article "Prime knots with arc index up to 11 and an upper bound of arc index for non-alternating knots", to appear in the Journal of Knot Theory and its Ramifications, we present minimal arc presentations of the prime knots up to arc index 11.

2010-10-14abs ↗pdf ↗

The grand arc graph's asymptotic dimension is shown to be infinite.

problem Determining the asymptotic dimension of the grand arc graph.
method Using Gromov-hyperbolic and cocompact arc and curve models, the asymptotic dimension is shown to be infinite for a broad class of surfaces.
result The asymptotic dimension of the grand arc graph is infinite.

The study counts arcs on hyperbolic surfaces, providing asymptotic growth formulas.

problem Counting arcs on hyperbolic surfaces with boundaries and cusps.
method Asymptotic analysis of pure mapping class group orbits and arc lengths.
result The number of arcs of bounded length is asymptotically proportional to L6g6+2(n+p)L^{6g-6+2(n+p)}.

The paper classifies virtual links using the arc shift operation.

problem Classifying \( n \)-component virtual links up to arc shift equivalence.
method Established the arc shift operation as an unknotting tool for \( n \)-homogeneous proper virtual links, explored its connection to the odd writhe, and identified sequences with specific arc shift bounds.
result Identified sequences of virtual link diagrams \( L_n \) with an upper bound of arc shift number equal to \( n \).

For any compact, connected, orientable, finite-type surface with marked points other than the sphere with three marked points, we construct a finite rigid set of its arc complex: a finite simplicial subcomplex of its arc complex such that any locally injective map of this set into the arc complex of another surface wit…

2019-09-19abs ↗pdf ↗

Graph conditions ensure matching arc complexes are connected and hyperbolic.

problem Conditions for connectedness and hyperbolicity of matching arc complexes.
method Conditions on finite simplicial graphs guaranteeing connectedness and hyperbolicity of matching arc complexes.
result Conditions on finite simplicial graphs ensure connectedness and hyperbolicity of matching arc complexes.