Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable subsurfaces of S.
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,742 papers · 148 categories
Trend · papers per month
48 results for “arc distance”
New geodesics for surfaces with boundary, extending Thurston's work.
problem Extending Thurston's Lipschitz distance to surfaces with boundaries.
method Constructing geodesics in the arc distance metric space.
result Teichmueller space of surfaces with boundaries is a geodesic metric space.
A knot K in 1-bridge position with respect to a genus-g Heegaard surface in a 3-manifold can be moved by isotopy through knots in 1-bridge position until it lies in a union of n parallel genus-g surfaces tubed together by n-1 straight tubes, with K intersecting each tube in two arcs connecting the ends. We prove that t…
Study geodesics and shortest arcs on Lie groups with specific metrics.
problem Characterize geodesics and shortest paths on Lie groups with sub-Riemannian metrics.
method Analytical and geometric methods to find geodesics and shortest arcs.
result Found geodesics, shortest arcs, distances, and conjugate loci for specified metrics.
Study shows singular set of distance functions is delta-convex.
problem Understanding singular set of distance functions in Finsler manifolds.
method Proved singular set is delta-convex hypersurfaces or Jordan arcs up to exceptional sets.
result Optimal results in Finsler manifolds, even in Euclidean space.
We study the connections between subsurface projections in curve and arc complexes in fibered 3-manifolds and Agol's veering triangulation. The main theme is that large-distance subsurfaces in fibers are associated to large simplicial regions in the veering triangulation, and this correspondence holds uniformly for all…
Study on curve shortening flow with boundary conditions, proving convergence or contraction.
problem Analyzing curve shortening flow with free boundaries.
method Introduced a reflected chord-arc profile and obtained chord-arc estimates.
result Proved that flows either converge to a critical chord or contract to a round half-point.
Sharp chord-arc estimates for curve shortening flow on spheres.
problem Understanding the behavior of curves on spheres under curve shortening flow.
method Proving sharp chord-arc estimates and curvature control.
result Simple spherical curves either contract to points or converge to great circles.
We show that if a Heegaard splitting is obtained by gluing a splitting of Hempel distance at least 4 and the genus-1 splitting of , then the Goeritz group of the splitting is finitely generated. To show this, we first provide a sufficient condition for a full subcomplex of the arc complex for a compact …
Let S be a compact surface, and M be the double of a handlebody. Given a homotopy class of maps from S to M inducing an isomorphism of fundamental groups, we describe a canonical uniformly lipschitz retraction of the sphere graph of M to the arc graph of S. We also show that this retraction is a uniformly bounded dista…
We show that the Teichmüller space of a surface without boundary and with punctures, equipped with Thurston's metric is the limit (in an appropriate sense) of Teichmüller spaces of surfaces with boundary, equipped with their arc metrics, when the boundary lengths tend to zero. We use this to obtain a result on the tran…
Gordian complexes of knots and virtual knots given by region crossing changes and arc shift movesmath.GT
Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in . Later Horiuchi and Ohyama defined Gordian complex of virtual knots using -move and forbidden moves. In this paper we discuss Gordian complex of knots by region crossing cha…
Smooth maps preserve distances on specific revolution surfaces.
problem Existence of smooth maps on revolution surfaces.
method Proving existence of maps preserving distances on meridians and parallels.
result Smooth maps exist from revolution surfaces to Euclidean plane.
Study spherical curves with curvature dependent on distance to a great circle.
problem Understanding spherical curves with curvature dependent on distance to a great circle.
method Introducing spherical angular momentum, characterizing known curves, finding new families, and obtaining arc length parametrizations.
result New families of spherical curves with intrinsic equations in elementary or Jacobi elliptic functions.
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. This link makes possible a better understanding of both theories. The concepts of the theory of affine spheres lead to a new definition of an …
Let be Heegaard surfaces of a closed orientable 3-manifold. In this paper, we introduce a method for giving an upper bound of Hempel distance of by using the Reeb graph derived from a certain horizontal arc in the ambient space of the Rubinstein-Scharlemann graphic derived from and …
We provide a new angle and obtain new results on a class of metrics on length-normalized curves in dimensions, represented by their unit tangents expressed as a function of arc-length, which are functions from the unit interval to the -dimensional unit sphere. These metrics are derived from the combined acti…
The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and v…
Given a Riemann surface with boundary S, the lengths of a maximal system of disjoint simple geodesic arcs on S that start and end at the boundary of S perpendicularly are coordinates on the Teichmueller space T(S). We compute the Weil-Petersson Poisson structure on T(S) in this system of coordinates and we prove that i…
In this note we introduce the (homologically essential) arc complex of a surface as a tool for studying properties of open book decompositions and contact structures. After characterizing destabilizability in terms of the essential translation distance of the monodromy of an open book we given an application of this re…
This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of -dimensional histograms having bins each. We prove that this problem is equivalent to an uncapacitated minimum cost flow problem on a -partite graph with nodes and arcs,…
Diffusion-weighted MR imaging (DWI) is the only method we currently have to measure connections between different parts of the human brain in vivo. To elucidate the structure of these connections, algorithms for tracking bundles of axonal fibers through the subcortical white matter rely on local estimates of the fiber …
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…
In this paper we study the notion of geodesic curvature of smooth horizontal curves parametrized by arc lenght in the Heisenberg group, that is the simplest sub-Riemannian structure. Our goal is to give a metric interpretation of this notion of geodesic curvature as the first corrective term in the Taylor expansion of …
We show that if the monodromy of an open book decomposition has sufficiently high displacement distance, acting on the loop and arc complex for a page, then it is the unique minimal Euler characteristic open book for the manifold. In particular, we show that such an open book induces the unique (up to isotopy) minimal …
Study on unknotting twisted knots using arc shift and region arc shift moves.
problem Unknotting twisted knots and finding bounds for region arc shift number.
method Introduced arc shift move and region arc shift move for twisted knots.
result Found families of twisted knots with specific arc shift and region arc shift numbers.
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 …
New findings on strong convexity in triangulations of convex polygons.
problem Understanding the structure of triangulations and their distances.
method Analyzing geodesic paths and flag triangulations in flip-graphs.
result Strong convexity properties of triangulations in convex polygons are not always preserved.
NT probability measures knotting in 3D arc systems.
problem Measuring knotting in 3D arc systems.
method Transforming polygonal arcs into unique diagrams, generalizing NT probability.
result Properties of NT probability for 3D arc systems are shown.
Non-trivialization probability of arc system in 3D space
problem Defining and generalizing the knotting probability of an arc diagram in 3D space
method Transforming polygonal arcs in 3D space into unique arc diagrams
result Introducing and generalizing the Non-Trivialization probability (NT probability) for arc systems in 3D space
Self-affine arcs without inner weak separation are parabolic segments.
problem Characterizing self-affine Jordan arcs without parabolic segments.
method Analyzing the weak separation property and proving implications for arc types.
result Self-affine Jordan arcs without parabolic segments are attractors of multizippers.
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.
We characterize the differentiable points of the distance function from a closed subset of an arbitrary dimensional Finsler manifold in terms of the number of -segments. In the case of a 2-dimensional Finsler manifold, we prove the structure theorem of the cut locus of a closed subset , namely that it is a lo…
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.
This paper calculates stick numbers for rail arcs and knot classes.
problem Calculating the minimum number of sticks needed for rail arcs and knot classes.
method Rail isotopies, ambient isotopies, winding number invariant, and lattice stick number.
result Calculates stick numbers for rail arcs and knot classes with crossing number at most 9.
Counts arcs in surfaces, proving convergence of geodesic currents.
problem Counting arcs of the same type in compact surfaces and related geometries.
method Derives convergence of geodesic currents to prove arc counts.
result Proves convergence of geodesic currents, leading to arc counting results.
Study arcs on surfaces, focusing on topological aspects and group actions.
problem Understanding arcs and their complements on surfaces.
method Characterize infinite-type surfaces via homeomorphic subsurfaces, construct actions on arc graphs.
result New characterisation of infinite-type surfaces and actions on arc graphs.
Listed 19,513 prime knots with arc index 12-16.
problem Tabulating prime knots with specific arc indices.
method Provided list of prime knots with minimal grid diagrams.
result 19,513 prime knots with arc index 12-16.
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.
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.
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 .
Study self-intersections of arcs on a pair of pants, proving natural number spectrum.
problem Understanding self-intersections of arcs on a pair of pants.
method Algorithm to compute self-intersection number, bounds established in terms of word length.
result Spectrum of self-intersection numbers covers all natural numbers.
Solve arc diagrams on surfaces via branched covers.
problem Computing arc diagrams on surfaces via branched covers.
method Represent branched covers combinatorially and solve membership problem.
result Efficient solution for triangulated arc diagrams.
Prime knots with arc index up to 11 and an upper bound of arc index for non-alternating knotsmath.GT
Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the arc index of the knot. We have identified all prime knots with arc index up to 1…
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 \).
The paper shows how to rearrange arcs to form closed curves.
problem Creating closed curves from planar arcs.
method Splitting a curve into arcs and rearranging them to form a closed curve.
result Closed curves can be formed by rearranging arcs under weak assumptions.
Expanded Legendrian knot atlas for 10-arc index knots.
problem Lack of Legendrian knot data for knots with high arc index.
method Created an atlas of Legendrian knots up to arc index 10.
result Legendrian knots of arc index 10 have been cataloged.
Classifies arcs on a 4-punctured sphere that intersect at most once.
problem Classifying arcs on a 4-punctured sphere with intersection constraints.
method Classification of maximal systems of arcs intersecting at most once.
result Maximal systems of arcs on the 4-punctured sphere identified.