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,695 papers · 148 categories

Trend · papers per month

306191121 · May 202619922001200920172026
48 results for virtual crossing

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 ↗

Refines virtual link equality criterion for diagrams with one virtual crossing.

problem Determining when a virtual link diagram represents a properly virtual link.
method Refines the Kauffman-Murasugi-Thislethwaite type inequality for virtual links.
result Criterion for virtual link diagrams with exactly one virtual crossing to represent a properly virtual link.

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 study virtual isotopy sequences with classical initial and final diagrams, asking when such a sequence can be changed into a classical isotopy sequence by replacing virtual crossings with classical crossings. An example of a sequence for which no such virtual crossing realization exists is given. A conjecture on con…

2003-03-06abs ↗pdf ↗

New polynomial invariants defined for long virtual knots.

problem Defining and studying polynomial invariants for long virtual knots.
method Intersection numbers of cycles on a closed surface, considering crossing order.
result Intersection polynomials are finite-type invariants of degree two under crossing changes, but not under virtualizations.

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 ↗

Given a virtual link diagram DD, we define its unknotting index U(D)U(D) to be minimum among (m,n)(m, n) tuples, where mm stands for the number of crossings virtualized and nn stands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram …

2018-06-05abs ↗pdf ↗

In this paper, we compute the slice genus for many low-crossing virtual knots. For instance, we show that 1295 out of 92800 virtual knots with 6 or fewer crossings are slice, and that all but 248 of the rest are not slice. Key to these results are computations of Turaev's graded genus, which we show extends to give an …

2017-08-20abs ↗pdf ↗

We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers mim_{i} (i=1,,n)(i=1,\ldots,n) and an ordered nn-component virtual link diagram DD, a new virtual link diagram D(m1,,mn)D(m_{1},\ldots,m_{n}) is ob…

2017-08-21abs ↗pdf ↗

We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we find all Parity Biquandles arising from the Alexander Biquandle and Quaternionic …

2011-03-15abs ↗pdf ↗

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 ↗

A virtual string can be defined as a closed curve on a surface modulo certain equivalence relations. Turaev defined several invariants of virtual strings which we use to produce a table of virtual strings up to 4 crossings. We discuss progress in extending the tabulation to 5 crossings. We also provide a counter-exampl…

2008-08-01abs ↗pdf ↗

Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss…

1998-11-05abs ↗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.

In this paper, we define the parity virtual Alexander polynomial following the work of BDGGHN [1] and Kaestner and Kauffman [10]. The properties of this invariant are explored and some examples are computed. In particular, the invariant demonstrates that many virtual knots can not be unknotted by crossing change on onl…

2019-07-19abs ↗pdf ↗

Study of generalized knots and links, proving inequality involving crossing number and braid index.

problem Proving an inequality involving the minimal crossing number and braid index for generalized knots and links.
method Introducing generalized crossings and moves, proving inequality for generalized knots and links.
result Proved inequality involving total crossing number and braid index for generalized knots and links.

We introduce two sequences of two-variable polynomials {LKn(t,)}n=1\{ L^n_K (t, \ell)\}_{n=1}^{\infty} and {FKn(t,)}n=1\{ F^n_K (t, \ell)\}_{n=1}^{\infty}, expressed in terms of index value of a crossing and nn-dwrithe value of a virtual knot KK, where tt and \ell are variables. Basing on the fact that nn-dwrithe is a flat virtual k…

2018-03-14abs ↗pdf ↗

A sequence of FF-polynomials {FKn(t,)}n=1\{ F^n_K (t, \ell)\}_{n=1}^{\infty} of virtual knots KK was defined by Kaur, Prabhakar, and Vesnin in 2018. These polynomials have been expressed in terms of index value of crossing and nn-writhe of KK. By the construction, FF-polynomials are generalizations of the Kauffman's Affine …

2019-06-02abs ↗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.

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used to reduce the number of crossings in a link and virtual link. For known unknots,…

2016-04-28abs ↗pdf ↗

For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the span of the f-polynomial of an alternating virtual link L is determined by the nu…

2004-12-03abs ↗pdf ↗

We prove that a virtual link diagrams satisfying two conditions on the Khovanov homology is minimal, that is, there is no virtual diagram representing the same link with smaller number of crossings. This approach works for both classical and virtual links

2005-01-23abs ↗pdf ↗

Two virtual link diagrams are homotopic if one may be transformed into the other by a sequence of virtual Reidemeister moves, classical Reidemeister moves, and self crossing changes. We recall the pure virtual braid group. We then describe the set of pure virtual braids that are homotopic to the identity braid.

2007-04-23abs ↗pdf ↗

We use the Bar-Natan Zh-correspondence to identify the generalized Alexander polynomial of a virtual knot with the Alexander polynomial of a two component welded link. We show that the Zh-map is functorial under concordance, and also that Satoh's Tube map (from welded links to ribbon knotted tori in S4S^4) is functoria…

2019-03-20abs ↗pdf ↗

This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram for K. Each state is reduced to a virtual 4-regular graph in the plane and the pol…

2007-12-15abs ↗pdf ↗

The paper generalizes virtual knot theory using multiple types of virtual crossings.

problem Generalizing virtual knot theory to include multiple types of virtual crossings.
method Starting with graph theory, the paper reviews previous work and then constructs multi-virtual knots and links.
result The multiplicity of virtual crossings allows for a broader application of the Penrose evaluation to all trivalent graphs.

In this paper we discuss how to define a chord index via smoothing a real crossing point of a virtual knot diagram. Several polynomial invariants of virtual knots and links can be recovered from this general construction. We also explain how to extend this construction from virtual knots to flat virtual knots.

2018-11-22abs ↗pdf ↗

This paper studies an algebraic invariant of virtual knots called the biquandle. The biquandle generalizes the fundamental group and the quandle of virtual knots. The approach taken in this paper to the biquandle emphasizes understanding its structure in terms of compositions of morphisms, where elementary morphisms ar…

2007-03-08abs ↗pdf ↗

A virtual nn-string αα is a collection of nn oriented smooth generic loops on a surface MM. A stabilization of αα is a surgery that results in attaching a handle to MM along disks avoiding αα, and the inverse operation is a destabilization of αα. We consider virtual nn-strings up to virtual homotopy, i.e., seq…

2017-09-05abs ↗pdf ↗

A realization of a virtual link diagram is obtained by choosing over/under markings for each virtual crossing. Any realization can also be obtained from some representation of the virtual link. (A representation of a virtual link is a link diagram on an oriented 2-dimensional surface.) We prove that if a minimal genus …

2005-02-23abs ↗pdf ↗