New moves transform any virtual knot to a trivial knot.
problem Transforming virtual knots to trivial knots.
method Introducing arc shift and region arc shift moves.
result Any virtual knot can be transformed into a trivial knot using these moves.
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “arc shift”
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.
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 \).
Shifts are not type-preserving on surface graphs.
problem Understanding the type-preserving property of shift maps on surface graphs.
method Analyzing Dehn twists and shift maps on arc, curve, and relative arc graphs of surfaces.
result Shift maps are not type-preserving on surfaces with isolated punctures.
Gordian complexes of knots and virtual knots given by region crossing changes and arc shift movesmath.GT
The paper explores Gordian complexes of knots and virtual knots using region crossing changes and arc shift moves.
problem Defining and analyzing Gordian complexes of knots and virtual knots using specific local moves.
method Region crossing change and arc shift move to construct Gordian complexes.
result Existence of arbitrarily high dimensional simplices in both Gordian complexes.
New infinite-type loxodromic elements found in surface mapping classes.
problem Identifying infinite-type loxodromic elements in mapping classes of surfaces.
method Constructing infinite families of mapping classes acting loxodromically on the relative arc graph.
result Explicit construction and characterization of infinite-type loxodromic elements.
Circular transformation of the European steel industry renders scrap metal a strategic resourceq-fin.TR
European steel industry shifts to electric arc furnaces, reducing scrap imports and increasing competition.
problem Reducing CO2 emissions in the European steel industry through electric arc furnaces.
method Combining trade data with business intelligence to model the impact of EAF capacity on scrap trade.
result Scrap imports decrease as EAF capacity increases, highlighting the need for a new business ecosystem.
Defines knotting probability for spatial arcs.
problem Calculating the probability of knotting in spatial arcs.
method Projection of spatial arcs to planes, defining knotting probability for diagrams.
result Knotting probability defined for every oriented spatial arc.
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.
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.
Finite rigid sets in arc complexes help classify surfaces.
problem Classifying surfaces based on their arc complexes.
method Constructing finite rigid sets in arc complexes of surfaces.
result Isomorphic arc complexes imply homeomorphic surfaces.
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 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.
Symplectifying Biarcsmath.SG
A new method joins two arcs with a degree of freedom.
problem Joining two arcs with a precise point.
method Geometric approach using tangent vectors and points.
result A novel method to determine the join point.
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.
Study links' arc index and Turaev genus, proving conjectures.
problem Understanding the arc index and Turaev genus of links.
method Computed arc index, established bounds, and conjectured inequalities.
result Proved conjectures linking crossing number, arc index, and Turaev genus.
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.
Improves arc separation result for homogeneous spaces.
problem Separating regions in homogeneous spaces by arcs.
method Using homogeneity instead of strong local homogeneity, and considering arcs with one interior point.
result Regions in homogeneous spaces of dimension ≥ 2 are not separated by arcs.
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…
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…
The flip graph and arc complex of a surface are shown to have finite rigidity.
problem Finite rigidity of flip graph and arc complex for surfaces.
method Embedding the flip graph in the arc complex and leveraging finite rigidity of the flip graph.
result Finite rigidity of the flip graph implies finite rigidity of the arc complex.
We describe unicorn paths in the arc graph and show that they form 1-slim triangles and are invariant under taking subpaths. We deduce that all arc graphs are 7-hyperbolic. Considering the same paths in the arc and curve graph, this also shows that all curve graphs are 17-hyperbolic, including closed surfaces.
We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in quadradic time in the number of crossings), and one which constructs a minimal subdi…
Researchers prove the arc complexes of decorated hyperbolic polygons are balls.
problem Understanding the structure of decorated hyperbolic polygons.
method Combinatorial approach using pseudo-manifolds and shellability.
result Arc complexes of decorated hyperbolic polygons are closed piecewise linear balls.
Quadratic bounds found for graph dimensions.
problem Understanding dimensions of arc and disk graphs.
method Quadratic upper bounds calculation.
result Asymptotic dimensions of arc and disk graphs have been bounded.
Generalised correlated batched bandits via the ARC algorithm with application to dynamic pricingmath.OC
ARC algorithm optimizes dynamic pricing with correlated observations.
problem Optimizing dynamic pricing with correlated and generally distributed observations.
method Extends ARC algorithm to batched bandits with generalised linear model.
result ARC algorithm outperforms alternative approaches in dynamic pricing.
Generates special homeomorphisms for complex surfaces.
problem Creating specific homeomorphisms for infinite-type surfaces.
method General conditions for producing endperiodic loxodromics.
result Produces homeomorphisms acting loxodromically on arc graphs.
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.
Research shows arc complex is not quasi-isometric to sphere complex.
problem Comparing quasi-isometry of arc complex and sphere complex.
method Simple proof of quasi-isometric rigidity of arc complex.
result Arc complex is not quasi-isometric to sphere complex.
Mixed labyrinth fractals can have finite or infinite arc lengths.
problem Characterizing the length of arcs in mixed labyrinth fractals.
method Analyzing sequences of labyrinth patterns to determine arc lengths.
result Arc lengths can be finite or infinite depending on pattern choice.
For the alternating knots or links, mutations do not change the arc index. In the case of nonalternating knots, some semi-alternating knots or links have this property. We mainly focus on the problem of mutation invariance of the arc index for nonalternating knots which are not semi-alternating. In this paper, we found…
Proves results on K-stability using arcs and Mabuchi functional.
problem K-stability in Fano manifolds and uniform K-polystability.
method Arcs and numerical criterion for stability of pairs.
result Characterizes coercivity of Mabuchi functional in terms of K-polystability.
Maximizes arcs on a sphere with constraints.
problem Finding the maximum number of arcs on a punctured sphere.
method Analyzing square annular diagrams and their dual curves.
result Proves the maximum size of arcs is \(\binom{n}{3}\).