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

6111722 · May 202219922001200920172026
48 results for 1-tangle diagrams

Given an invariant J(K) of a knot K, the corresponding (1,1)-tangle invariant J'(K)=J(K)/J(U) is defined as the quotient of J(K) by its value J(U) on the unknot U. We prove here that J' is always an integer 2-variable Laurent polynomial when J is the Homfly satellite invariant determined by decorating K with any eigenv…

2006-06-14abs ↗pdf ↗

A genus-1 tangle G is an arc properly embedded in a standardly embedded solid torus S in the 3-sphere. We say that a genus-1 tangle embeds in a knot K in S^3 if the tangle can be completed by adding an arc exterior to the solid torus to form the knot K. We call K a closure of G. An obstruction to embedding a genus-1 ta…

2012-08-20abs ↗pdf ↗

Given a compact oriented 3-manifold M in S^3 with boundary, an (M,2n)-tangle T is a 1-manifold with 2n boundary components properly embedded in M. We say that T embeds in a link L in S^3 if T can be completed to L by a 1-manifold with 2n boundary components exterior to M. The link L is called a closure of T. We define …

2013-09-18abs ↗pdf ↗

This paper refines previous work by the first author. We study the question of which links in the 3-sphere can be obtained as closures of a given 1-manifold in an unknotted solid torus in the 3-sphere (or genus-1 tangle) by adjoining another 1-manifold in the complementary solid torus. We distinguish between even and o…

2014-07-30abs ↗pdf ↗

The abstract describes a strategy to construct reduced Khovanov homology for links in lens spaces.

problem Constructing reduced Khovanov homology for links in lens spaces.
method Generalizing a symplectic interpretation of reduced Khovanov homology for links in S3S^3 and constructing cochain complexes for links in S3S^3 and S2imesS1S^2 imes S^1.
result The cohomology of the constructed cochain complex for links in S2imesS1S^2 imes S^1 may be a link invariant.

We generalize our previous work on categorification of Kauffman bracket skein module of surfaces, by extending our homology to tangles in cylinders over surfaces, F x [0,1]. Our homology of 0-tangles and 1-tangles in D^3 coincides (up to normalization) with Khovanov link homology and the reduced Khovanov link homology.…

2004-10-09abs ↗pdf ↗

We introduce and study in detail an invariant of (1,1) tangles. This invariant, derived from a family of four dimensional representations of the quantum superalgebra U_q[gl(2|1)], will be referred to as the Links-Gould invariant. We find that our invariant is distinct from the Jones, HOMFLY and Kauffman polynomials (de…

1998-11-23abs ↗pdf ↗

A tangle is an oriented 1-submanifold of the cylinder whose endpoints lie on the two disks in the boundary of the cylinder. Using an algebraic tool developed by Lescop, we extend the Burau representation of braids to a functor from the category of oriented tangles to the category of Z[t,t^{-1}]-modules. For (1,1)-tangl…

2012-03-20abs ↗pdf ↗

Let qq be a 2N2Nth root of unity where NN is odd. Let Uq(sl2)U_q(sl_2) denote the quantum group with large center corresponding to the lie algebra sl2sl_2 with generators E,F,KE,F,K, and K1K^{-1}. A semicyclic representation of Uq(sl2)U_q(sl_2) is an NN-dimensional irreducible representation $ρ:U_q(sl_2)\rightarrow M_N(\mathbb{C}…

2016-07-07abs ↗pdf ↗

We study relationships between the restricted unrolled quantum group UqH(sl2)\overline{U}_q^H(\mathfrak{sl}_2) at 2r2r-th root of unity q=eπi/r,r2q=e^{πi/r}, r \geq 2, and the singlet vertex operator algebra M(r)\mathcal M(r). We use deformable families of modules to efficiently compute (1,1)(1, 1)-tangle invariants colored with projecti…

2016-05-18abs ↗pdf ↗

The knot coloring polynomial defined by Eisermann for a finite pointed group is generalized to an infinite pointed group as the longitudinal mapping invariant of a knot. In turn this can be thought of as a generalization of the quandle 2-cocycle invariant for finite quandles. If the group is a topological group then th…

2018-02-24abs ↗pdf ↗

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

problem Investigating transformations and deformations of lattice diagrams and their associated dotted diagrams.
method Introducing dotted diagrams and investigating deformations of these diagrams, relating them to transformations of lattice diagrams.
result Refined results on the relation between deformations of admissible dotted diagrams and transformations of lattice diagrams.

Researchers link knot Floer homology, Burau representation, and quantum gl(1|1).

problem Understanding the Burau representation and its relation to knot Floer homology.
method Developed a Heegaard Floer homology theory and associated a bordered sutured Heegaard Floer homology group to any tangle.
result Established a connection between the Burau representation and quantum gl(1|1), leading to a geometric proof of the braid representation.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

2016-06-02abs ↗pdf ↗

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

problem Classifying knots and links as rigid or shaky based on adaptability to Reidemeister moves.
method Categorization of hard diagrams as rigid or shaky, investigation of rigid and shaky hard diagrams for specific knots and links.
result Every link has a rigid hard diagram, and there is an upper limit for the number of crossings in such diagrams.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

2007-06-19abs ↗pdf ↗

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

2017-12-25abs ↗pdf ↗

Problems on region choices for knot and link diagrams solved using Alexander numbering.

problem Existence of solutions for region choice problems on knot and link diagrams.
method Alexander numbering for regions, alternative proofs, necessary and sufficient conditions.
result Existence of solutions for region choice problems on link diagrams.

The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…

2018-03-19abs ↗pdf ↗

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…

2006-04-30abs ↗pdf ↗

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.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.

New estimate of semimeander complexity for knots with more than 10 crossings.

problem Estimating the complexity of semimeander diagrams of knots.
method Proved a new upper bound on the number of crossings for semimeander diagrams of knots with more than 10 crossings.
result For knots with more than 10 crossings, semimeander diagrams have no more than 0.311.558cr(K)0.31 \cdot 1.558^{\operatorname{cr}(K)} crossings.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

2010-07-23abs ↗pdf ↗

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2\mathbb{CP}^2 under certain conditions.

Complete criterion for VoI in multi-decision influence diagrams established.

problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.