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,657 papers · 148 categories

Trend · papers per month

4998147196 · May 202619922001200920172026
48 results for arc smoothing

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.

A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible to move these arcs around in B by a homotopy and to give a library of examples w…

2014-11-06abs ↗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.

By an influential theorem of Boman, a function ff on an open set UU in Rd\mathbb R^d is smooth (C\mathcal C^\infty) if and only if it is arc-smooth, i.e., fcf\circ c is smooth for every smooth curve c:RUc : \mathbb R \to U. In this paper we investigate the validity of this result on closed sets. Our main focus is on s…

2018-01-25abs ↗pdf ↗

We introduce a useful tool for analyzing boosting algorithms called the ``smooth margin function,'' a differentiable approximation of the usual margin for boosting algorithms. We present two boosting algorithms based on this smooth margin, ``coordinate ascent boosting'' and ``approximate coordinate ascent boosting,'' w…

2008-03-28abs ↗pdf ↗

Paper estimates optimal ROC curve arc length and AUC, improving classification performance.

problem Estimating optimal ROC curve arc length and AUC in imbalanced binary classification.
method Expresses arc length and AUC as variational objectives, estimating using positive and negative samples.
result Proposed classification procedure maximizes an approximate lower bound of maximal AUC.

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 ↗

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)}.

Based on hyperbolic geometric considerations, Roger and Yang introduced an extension of the Kauffman bracket skein algebra that includes arcs. In particular, their skein algebra is a deformation quantization of a certain commutative curve algebra, and there is a Poisson algebra homomorphism between the curve algebra an…

2019-09-06abs ↗pdf ↗

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.

Minimal grid diagrams found for 13-crossing prime knots with 13 arc index.

problem Finding minimal grid diagrams for prime knots with specific crossing and arc indices.
method Used Knotscape to generate spanning trees and obtain minimal arc presentations in grid diagrams.
result 9,988 prime knots with 13 crossings and 13 arc index were identified.

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 paper explores when specific knot operations simplify diagrams.

problem Understanding when arc crossing changes simplify knot diagrams.
method Examined two types of arc crossing changes on link diagrams and determined when they are unknotting operations.
result Any two crossing points in an alternating knot diagram are arc crossing change admissible.

It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is strictly less than the minimal crossing number. We also give minimal grid diagrams o…

2011-06-13abs ↗pdf ↗

In this paper are studied the simplest patterns of axial curvature lines (along which the normal curvature vector is at a vertex of the ellipse of curvature) near a critical point of a surface mapped into R4. These critical points, where the rank of the mapping drops from 2 to 1, occur isolated in generic one parameter…

2013-04-06abs ↗pdf ↗