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.

169,181 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for virtual bridge number

Study bridges between biquandles, quivers, and virtual link bridge numbers.

problem Understanding the gap between different formulations of bridge numbers for virtual links.
method Investigates connections between biquandle colorings, quiver enhancements, and bridge numbers.
result Shows existence of virtual links with specific bridge numbers and constructs families distinguishing quiver invariants.

Using Gauss diagrams, one can define the virtual bridge number vb(K){\rm vb}(K) and the welded bridge number wb(K),{\rm wb}(K), invariants of virtual and welded knots with wb(K)vb(K).{\rm wb}(K) \leq {\rm vb}(K). If KK is a classical knot, Chernov and Manturov showed that vb(K)=br(K),{\rm vb}(K) = {\rm br}(K), the bridge number as a classical …

2014-12-07abs ↗pdf ↗

We define the virtual bridge number vb(K)vb(K) and the virtual unknotting number vu(K)vu(K) invariants for virtual knots. For ordinary knots KK they are closely related to the bridge number b(K)b(K) and the unknotting number u(K)u(K) and we have vu(K)u(K),vb(K)b(K).vu(K)\leq u(K), vb(K)\leq b(K). There are no ordinary knots KK with b(K)=1.b(K)=1. We…

2007-12-14abs ↗pdf ↗

In our works with Stoimenow, Vdovina and with Byberi, we introduced the virtual canonical genus gvc(K)g_{vc}(K) and the virtual bridge number vb(K)vb(K) invariants of virtual knots. One can see from the definitions that for an classical knot KK the values of these invariants are less or equal than the classical canonical gen…

2012-09-02abs ↗pdf ↗

We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation whose length is a cubic function of the number of 'riser marks'. For classical knots…

2012-08-01abs ↗pdf ↗

This paper connects virtual biquandles to biquandles for virtual link colorings.

problem Extending invariants from biquandles to virtual biquandles.
method Establishing equivalence between two representations of virtual braid groups and introducing new labeling rules.
result The number of colorings of a virtual link by virtual biquandles can be recovered from colorings by biquandles.

We show that all two-bridge knot and link complements are virtually fibered. We also show that spherical Montesinos knot and link complements are virtually fibered. This is accomplished by showing that such knot complements are finitely covered by great circle link complements.

2004-07-21abs ↗pdf ↗

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 ↗

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…

2017-01-15abs ↗pdf ↗

We show that for certain hyperbolic 3-manifolds, all boundary slopes are slopes of immersed incompressible surfaces, covered by incompressible embeddings in some finite cover. The manifolds include hyperbolic punctured torus bundles and hyperbolic two-bridge knots.

1999-01-09abs ↗pdf ↗

We investigate great circle links in the three-sphere, the class of links where each component is a great circle. Using the geometry of their complements, we classify such links up to five components. For any two-bridge knot complement, there is a finite cover that is the complement of a link of great circles in S3S^3.…

2003-08-06abs ↗pdf ↗

Study on knot diagrams showing bridge number can differ from crossing number.

problem Incompatibility between crossing number and bridge number for knot diagrams.
method Defined and compared various bridge number computations for knot diagrams, studied minimizing diagrams, and constructed families of minimal crossing diagrams.
result Found examples where bridge number differs from crossing number, and demonstrated this difference can grow infinitely.

VR enables professionals to develop deep learning models by moving virtual objects.

problem Challenges in understanding and developing deep learning models.
method Built a VR-based DL development environment where users interact with tangible objects to construct neural networks.
result Users can develop and understand DL models intuitively through VR, with real-time accuracy feedback.

The paper finds the minimum number of intersections for curves under virtual homotopy.

problem Finding the minimum number of intersections for curves under virtual homotopy.
method Using generalizations of the Anderson--Mattes--Reshetikhin Poisson bracket and the Cahn cobracket.
result The minimal number of intersections equals to the number of terms of a generalized Poisson bracket for pairs of curves, and can be counted by a generalized cobracket for a single curve.

We construct new invariant polynomial for long virtual knots. It is a generalization of Alexander polynomial. We designate it by ζζ meaning an analogy with ζζ-polynomial for virtual links. A degree of ζζ-polynomial estimates a virtual crossing number. We describe some application of ζζ-polynomial for the study of m…

2009-06-23abs ↗pdf ↗

Proposes a data augmentation method to improve multi-label learning performance.

problem Improving multi-label learning by exploiting label correlations and data augmentation.
method Proposes a novel data augmentation approach that performs clustering on real examples and treats cluster centers as virtual examples, promoting local smoothness through a regularization term.
result Extensive experiments show that the proposed method outperforms state-of-the-art multi-label learning approaches.

A new index measures how many changes are needed to turn virtual links into simple ones.

problem Determining the minimum number of changes needed to simplify virtual link diagrams.
method Defined the unknotting index using virtual crossings and classical changes, provided lower and upper bounds.
result Found bounds for the unknotting index of virtual links, including those from pretzel links.

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic immersion of a singular link in R2R^{2}. We tackle this problem by the so-called…

2008-11-05abs ↗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 \).

Paper constructs cyclic coverings of virtual link diagrams, proving equivalence of certain maps.

problem Constructing and proving equivalence of cyclic coverings of virtual link diagrams.
method Introducing mm-fold cyclic covering diagrams and proving their equivalence to original diagrams.
result Well-defined map from virtual links to mod mm almost classical virtual links.

We provide a new proof of the following results of H. Schubert: If K is a satellite knot with companion J and pattern L that lies in a solid torus T in which it has index k, then the bridge numbers satisfy the following: 1) The bridge number of K is greater than or equal to the product of k and the bridge number of J; …

2001-11-02abs ↗pdf ↗

This article serves a few purposes. First of all, it reviews polyfold--Kuranishi correspondence I (http://arxiv.org/abs/1402.7008) and previews and samples some results from four papers I have been preparing. It is also a written-up and expanded version of a talk I gave at a symplectic conference in Chengdu on June 28,…

2015-10-23abs ↗pdf ↗

We show that there are hyperbolic tunnel-number one knots with arbitrarily high bridge number and that "most" tunnel-number one knots are not one-bridge with respect to an unknotted torus. The proof relies on a connection between bridge number and a certain distance in the curve complex of a genus-two surface.

2006-03-03abs ↗pdf ↗

Extends classical results to virtual links, proving new properties of alternating and semi-alternating virtual links.

problem Classical results for virtual links, focusing on alternating and semi-alternating links.
method Inequality relating link determinant and crossing number, matrix-tree theorem, Tait conjectures for virtual and welded links.
result Alexander polynomial of almost classical alternating virtual links is alternating.

For any given number of crossings cc, there exists a formula to determine the number of 2-bridge knots of cc crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of whether a given (prime) knot is a 2-bridge knot remains a nontrivial exercise, and …

2004-09-20abs ↗pdf ↗

Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer {\it arrow number} calculated from each loop in an oriented state summa…

2009-06-18abs ↗pdf ↗