The paper studies the geometry of Wigner caustics and decomposes curves into parallel arcs.
problem Understanding the geometry and properties of Wigner caustics of curves.
method Decomposing curves into parallel arcs to analyze the Wigner caustic's smooth branches, inflexion points, and singularities.
result New insights into the number of smooth branches, rotation number, inflexion points, and cusp singularities of the Wigner caustic.
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…
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.
New classes of semimetals predict torsion Fermi arcs.
problem Understanding the subtle interplay between local and global charges in topological semimetals.
method Using geometric exact sequences and cohomological semimetal invariants.
result Prediction of torsion Fermi arcs in new classes of semimetals.
In this paper, the parallel transport frames over non-lightlike curves in Minkowski 3-space are introduced. Evolution equations of these frames with respect to arc length and time are calculated over the space of these curves. Then the equivalence of the non-linear Schrödinger equation and non-linear heat system to the…
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.
VISTA learns causal structures by integrating local subgraphs, improving accuracy and efficiency.
problem Efficiently learning causal structures from high-dimensional observational data.
method VISTA decomposes the global causal structure learning problem into local subgraphs based on Markov Blankets, integrating them via a weighted voting mechanism.
result VISTA achieves notable improvements in accuracy and efficiency over existing methods.
Innovates a new algebraic structure for handlebody-links.
problem Defining invariants for handlebody-links.
method Introduces multiple conjugation biquandle and extends biquandle operations.
result Establishes a universal algebra for handlebody-links coloring.
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.
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.
In this paper, we show the existence of real-analytic stationary Navier-Stokes flows with isotropic streamlines in all latitudes in some simply-connected flow region on a rotating round sphere. We also exclude the possibility of having a Poiseuille's flow profile to be one of these stationary Navier-Stokes flows with i…
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.
Study shows certain knot invariants are unchanged by 4-moves.
problem Ineffectiveness of homotopical invariants on 4-moves.
method Examined Dabkowski-Sahi invariant and fundamental group.
result Knot invariants based on fundamental group are constant under 4-moves.
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.
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.
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 L6g−6+2(n+p). 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 paper finds the unique minimizer of area for hyperbolic bodies with curvature constraints.
problem Finding the unique minimizer of area for hyperbolic bodies with curvature constraints.
method Introduced the concept of 'thick λ-sausage' bodies and used extra assumption of thickness to handle non-convex inner parallel bodies. result The thick λ-sausage body is the unique minimizer of area among all bodies with a given length and curvature constraints. 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.
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.
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.
Study shows mutation invariance of arc index for some Montesinos knots.
problem Investigate mutation invariance of arc index for nonalternating knots.
method Analyzed families of Montesinos knots, found mutant pairs/triples with same arc index.
result Found infinitely many mutant pairs/triples of Montesinos knots with the same arc index.
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.
A knot K in a closed connected orientable 3-manifold M is called a 1-genus 1-bridge knot if (M,K) has a splitting into two pairs of a solid torus V_i (i=1,2) and a boundary parallel arc in it. The splitting induces a genus two Heegaard splitting of the exterior of K naturally, i.e., K has an unknotting tunnel. However …
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.
New knot polynomials derived from 1-cocycles in knot moduli spaces.
problem Detecting knot properties using polynomial invariants from 1-cocycles.
method Constructing 1-cocycles Rn on moduli spaces Mn of knots, associating them to arc scans, and calculating their values for canonical loops. result Polynomial knot invariants Rn can detect non-invertibility and distinguish knot types. New upper bound found for arc index of spatial graphs.
problem Finding an upper limit for the arc index of spatial graphs.
method Extended the definition of arc presentation to spatial graphs and derived a new upper bound.
result The upper bound on the arc index of any spatial graph is lowest possible.
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.
Max arcs on spheres intersecting twice, proven.
problem Maximizing arcs on spheres with intersection constraints.
method Proved maximal cardinality of arcs intersecting at most twice.
result Maximal cardinality of arcs intersecting at most twice is |X|(|X| + 1)(|X| + 2).
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.