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

109218326435 · Jun 202019922001200920172026
48 results for Band-unlinking number

In this paper, we study surfaces embedded in 44-manifolds. We give a complete set of moves relating banded unlink diagrams of isotopic surfaces in an arbitrary 44-manifold. This extends work of Swenton and Kearton-Kurlin in S4S^4. As an application, we show that bridge trisections of isotopic surfaces in a trisected …

2018-04-24abs ↗pdf ↗

New method for quandle presentations of surface knots in 4-manifolds.

problem Computing fundamental quandle presentations for surface knots in arbitrary 4-manifolds.
method Wirtinger type presentation of the fundamental quandle for surface links in 4-manifolds.
result Infinitely many pairwise non-local surface knots with specific bridge numbers in certain 4-manifolds.

Given a connected cobordism between two knots in the 3-sphere, our main result is an inequality involving torsion orders of the knot Floer homology of the knots, and the number of local maxima and the genus of the cobordism. This has several topological applications: The torsion order gives lower bounds on the bridge i…

2019-04-04abs ↗pdf ↗

New invariant shows fifth move is unique and extends biquandle theory for surface-links.

problem Reproduce Yoshikawa's fifth move using other moves and isotopies.
method Develops a semi-invariant and biquandle-based invariant for surface-links.
result Yoshikawa's fifth move is unique and cannot be reproduced by other moves.

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

2015-07-15abs ↗pdf ↗

The paper bounds the handle number of sutured manifolds using Morse-Novikov numbers and tunnel numbers.

problem Bounding the handle number of sutured manifolds.
method Developed bounds on the Morse-Novikov number of a link in terms of its tunnel number, and used these to bound the handle number of Heegaard splittings.
result The handle number function is bounded, constant on rays from the origin, and locally maximal.

New measure shows how links can be untangled as twists increase.

problem Understanding how links can be simplified through repeated twists.
method Introduced the stable unknotting number to analyze links in a twist family.
result The stable unknotting number depends only on the winding number of the link, not the wrapping number.

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist infinitely many positive knots with any dealternating number (or any alternation…

2008-08-05abs ↗pdf ↗

Delta-unlinking number measures how to unlink algebraically split links.

problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.

Study on knot properties, showing relation between unknotting and crossing numbers.

problem Relations between unknotting and crossing numbers of spatial embeddings.
method Analyzes handcuff-graphs and theta curves, extends known results to handlebody-knots.
result Characterizes handlebody-knots satisfying the equality between unknotting and crossing numbers.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…

2011-07-25abs ↗pdf ↗

In this paper we investigate the unlinking numbers of 10-crossing links. We make use of various link invariants and explore their behaviour when crossings are changed. The methods we describe have been used previously to compute unlinking numbers of links with crossing number at most 9. Ultimately, we find the unlinkin…

2017-01-05abs ↗pdf ↗

This paper is about the clock number of a knot. First we define the clock number by using states of a knot defined by Kauffman. Next we show that if K is a prime knot, its clock number is greater than or equal to its crossing number. Finally we prove that its clock number is equal to its crossing number if and only if …

2011-03-01abs ↗pdf ↗

We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number, which is the minimal number of crossing changes to a slice knot; and the concordanc…

2013-11-26abs ↗pdf ↗

Jablan and Radović originally defined two invariants called the Meander number and OGC number of knots for certain classes of knots. We generalize these definitions to all knots and name the straight number and contained straight number of a knot, respectively, and prove they are well defined. We answer two questions a…

2018-01-31abs ↗pdf ↗

A rational linear combination of Chern numbers is an oriented diffeomorphism invariant of smooth complex projective varieties if and only if it is a linear combination of the Euler and Pontryagin numbers. In dimension at least three only multiples of the top Chern number, which is the Euler characteristic, are invarian…

2011-10-31abs ↗pdf ↗

An nn-crossing is a point in the projection of a knot where nn strands cross so that each strand bisects the crossing. An übercrossing projection has a single nn-crossing and a petal projection has a single nn-crossing such that there are no loops nested within others. The übercrossing number, u¨(K)\text{ü}(K), is the…

2013-11-03abs ↗pdf ↗

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel number of a composite genus 2 spatial graph. For the tunnel number of a composite …

2019-12-18abs ↗pdf ↗

The paper tabulates and computes the number of alternating pretzel links up to a given crossing number.

problem Computing the total number of alternating pretzel links for a given crossing number.
method Derived a closed formula to compute the total number of alternating pretzel links, P(c)\mathcal{P}(c), for any given crossing number cc.
result The number of alternating pretzel links grows exponentially with the crossing number.

In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that LL has vanishing pairwise linking numbers, this triple linking number gives an integ…

2019-01-16abs ↗pdf ↗

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain mm-component T2T^2-link (m3m \geq 3) determined from two commutative pure mm-braids aa and bb. We present the triple linking number of such a T2T^2-link, by usin…

2011-02-18abs ↗pdf ↗

We prove that the number of combinatorially distinct causal 3-dimensional triangulations homeomorphic to the 3-dimensional sphere is bounded by an exponential function of the number of tetrahedra. It is also proven that the number of combinatorially distinct causal 4-dimensional triangulations homeomorphic to the 4-sph…

2014-08-09abs ↗pdf ↗

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly embedded in 4-dimensional ball, bounding the knot. Clearly the 4-dimensional crosscap …

2006-08-16abs ↗pdf ↗

The paper studies how the crossing number of graphs changes with a specific transformation called ΔY-move.

problem Investigating how the crossing number of graphs changes under the ΔY-move transformation.
method Analyzing the behavior of crossing number under the ΔY-move transformation on complete graphs.
result For any natural number k, there exists a sequence of ΔY-moves that decreases the crossing number of a complete graph.

In this paper we introduce the concept of a space-efficient knot mosaic. That is, we seek to determine how to create knot mosaics using the least number of non-blank tiles necessary to depict the knot. This least number is called the tile number of the knot. We determine strict bounds for the tile number of a knot in t…

2017-02-21abs ↗pdf ↗

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger number of a virtual link equals its virtual bridge number. Since the Wirtinger number…

2018-01-09abs ↗pdf ↗

Study minimizes crossing points of up to 12 curves on a genus 2 surface.

problem Minimizing intersection points of curves on a surface.
method Analyzes systems of up to 12 simple closed curves on a genus 2 surface to find the minimum crossing number.
result Determines the minimal crossing number of up to 12 curves on a genus 2 surface and proves the minimization systems are unique.