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

36912 · Apr 201919922001200920172026
48 results for bipartite tangles

Planar decomposition simplifies HOMFLY polynomial calculation for certain knots and links.

problem Calculating HOMFLY polynomial for specific types of knots and links.
method Planar decomposition of bipartite diagrams, lifting from sl(2) to sl(N).
result HOMFLY polynomials of many knots and links have planar decompositions.

There exists a simplified Bar-Natan Khovanov complex for open 2-braids. The Khovanov cohomology of a knot diagram made by gluing tangles of this type is therefore often amenable to calculation. We lift this idea to the level of the Lipshitz-Sarkar stable homotopy type and use it to make new computations. Similarly, the…

2015-06-25abs ↗pdf ↗

Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including im…

2014-03-12abs ↗pdf ↗

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for knotted trivalent graphs. Our method also yields invariants of, what we refer to as…

2018-06-17abs ↗pdf ↗

This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of non-trivial colorings for the tangles in question. Our main result in this article i…

2019-04-11abs ↗pdf ↗

We introduce a generalization of oriented tangles, which are still called tangles, so that they are in one-to-one correspondence with the sutured manifolds. We define cobordisms between sutured manifolds (tangles) by generalizing cobordisms between oriented tangles. For every commutative algebra A over Z/2Z, we define …

2016-10-23abs ↗pdf ↗

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof defines the tangle fraction from the canonical form and uses flyping to prove in…

2003-11-27abs ↗pdf ↗

We show that for a tangle TT with 0T1T-\partial^0T \cong \partial^1 T the Hochschild homology of the tangle Floer homology CT~(T)\widetilde{\mathit{CT}}(T) is equivalent to the link Floer homology of the closure T=T/(0T1T)T' = T/(-\partial^0T \sim \partial^1 T) of the tangle, linked with the tangle axis. In addition, we show that t…

2015-03-22abs ↗pdf ↗

In this paper, We introduce an invariant of rational n-tangles which is obtained from the Kauffman bracket. It forms a vector with Laurent polynomial entries. We prove that the invariant classifies the rational 2-tangles and the reduced alternating rational 3-tangles. We conjecture that it classifies the rational 3-tan…

2014-01-28abs ↗pdf ↗

The paper addresses the kk-tangle enumeration problem. We introduce a notion of cascade diagram for kk-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

2007-12-22abs ↗pdf ↗

We note that a rational 33-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational 33-tangle diagrams up to isotopy. However, there is no perfect classification about rational 33-tangle diagrams such as the classification of rational 22-tangle diagrams cor…

2015-02-19abs ↗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 ↗

New model for detecting communities in weighted bipartite networks.

problem No model for community detection in overlapping bipartite weighted networks.
method Introduces BiMMDF model allowing any distribution with block structure.
result Efficient algorithm with theoretical guarantee of consistent estimation.

Tangle machines are a topologically inspired diagrammatic formalism to describe information flow in networks. This paper begins with an expository account of tangle machines motivated by the problem of describing `covariance intersection' fusion of Gaussian estimators in networks. It then gives two examples in which ta…

2015-11-16abs ↗pdf ↗

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 ↗

Study on coloring virtual tangles with integer and modular arithmetic.

problem Characterizing Fox colorings of virtual tangle diagrams.
method Analyzed classical and virtual tangle diagrams using vector representations and divisibility conditions.
result For R=ZR=\mathbb{Z}, realizability depends on divisibility of the alternating sum. For R=Z/pZR=\mathbb{Z}/p\mathbb{Z}, all vectors are realizable.

The paper examines when 2-string tangles can be embedded into specific link types.

problem When 2-string tangles can be embedded into the unknot, unlink, or split links.
method Geometric characterizations, tangle sums, and colorings.
result Prime 2-string tangles with up to seven crossings are classified for embedding into specific link types.

It is known that there are 21 ribbon knots with 10 crossings or fewer. We show that for every ribbon knot, there exists a tangle that satisfies two properties associated with the knot. First, under a specific closure, the closed tangle is equivalent to its corresponding knot. Second, under a different closure, the clos…

2017-05-29abs ↗pdf ↗