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

24487296 · Jun 202019922001200920172026
48 results for link colorings

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link.…

2016-05-26abs ↗pdf ↗

Aicardi's invariant F(L)F(L) is extended to colored singular links using graphical calculus.

problem Constructing an invariant for colored classical and singular links.
method State-sum model using graphical calculus for oriented, colored, 4-valent planar graphs.
result Extends F(L)F(L) to colored singular links, showing it's stronger than HOMFLY-PT polynomial.

Classifies colored links and spatial graphs up to colored link-homotopy.

problem Classifying colored links and spatial graphs up to colored link-homotopy.
method Using Habegger-Lin theory for colored string links, and extending to colored links and spatial graphs.
result Classification of colored links and spatial graphs up to colored link-homotopy.

The minimal coloring number of a Z\mathbb{Z}-colorable link is the minimal number of colors for non-trivial Z\mathbb{Z}-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable Z\mathbb{Z}-colorable links is four. As an example, we consider the link obtained by…

2017-05-22abs ↗pdf ↗

We determine the minimal number of colors for non-trivial Z\mathbb{Z}-colorings on the standard minimal diagrams of Z\mathbb{Z}-colorable torus links. Also included are complete classifications of such Z\mathbb{Z}-colorings and of such Z\mathbb{Z}-colorings by only four colors, which are shown by using rack colorin…

2019-08-02abs ↗pdf ↗

Study on colored Jones polynomial and link complements.

problem Understanding the structure of link complements with arbitrary colors.
method Investigated the potential function of the colored Jones polynomial and established a relationship with hyperbolicity.
result Evidence supports the Chen-Yang conjecture on link complements.

For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the minimum to the maximum number of colors. Furthermore, for any rational link, we prove …

2012-05-07abs ↗pdf ↗

The paper introduces two-tone colorings for links and shows conditions for surjective dihedral representations.

problem The challenge is to find conditions for links to admit surjective dihedral representations.
method The method involves introducing two-tone colorings and providing conditions for the link groups to admit such representations.
result Any link with at least 3 components admits a surjective homomorphism to the dihedral group of arbitrary degree.

This paper shows all elements in the 3-colorable subgroup of Thompson's group give 3-colorable links.

problem Exploring the relationship between elements in the 3-colorable subgroup of Thompson's group and 3-colorable links.
method Defined the 3-colorable subgroup and used Jones's method to construct knots and links from elements of Thompson's group.
result All elements in the 3-colorable subgroup give 3-colorable links.

The notion of chckerboard colorability for virtual links and abstract links is introduced. We study the Jones polynomials of virtual links and abstruct links. It is proved that a certain property of the Jones polynomials of classical links is valid for virtual links which admit checkerboard colorings.

2000-08-10abs ↗pdf ↗

A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (…

2014-06-09abs ↗pdf ↗

In this paper, we use `generalized Seifert surfaces' to extend the Levine-Tristram signature to colored links in S^3. This yields an integral valued function on the m-dimensional torus, where m is the number of colors of the link. The case m=1 corresponds to the Levine-Tristram signature. We show that many remarkable p…

2005-05-10abs ↗pdf ↗

We define a Khovanov homotopy type for sl2(C)sl_2(\mathbb{C}) colored links and quantum spin networks and derive some of its basic properties. In the case of nn-colored B-adequate links, we show a stabilization of the homotopy types as the coloring nn\rightarrow\infty, generalizing the tail behavior of the colored Jones …

2016-02-11abs ↗pdf ↗

The colored Jones polynomial is a qq-polynomial invariant of links colored by irreducible representations of a simple Lie algebra. A qq-series called a tail is obtained as the limit of the sl2\mathfrak{sl}_2 colored Jones polynomials {Jn(K;q)}n\{J_n(K;q)\}_n for some link KK, for example, an alternating link. For the $\mathf…

2016-12-07abs ↗pdf ↗

For any link and for any modulus mm we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…

2012-08-05abs ↗pdf ↗

We introduce colorings of oriented surface-links by biquasiles using marked graph diagrams. We use these colorings to define counting invariants and Boltzmann enhancements of the biquasile counting invariants for oriented surface-links. We provide examples to show that the invariants can distinguish both closed surface…

2017-07-04abs ↗pdf ↗

Explains a 2D color exchange invariant correspondence to 3D linking numbers.

problem Understanding color exchange invariants in 2D dynamics and their 3D geometric interpretation.
method Visualizes invariants as linking of lines on a special surface with Arf-Kervaire invariant one, and interprets it as an obstruction to continuous transformation.
result Interprets a 2D color exchange invariant as a 3D linking number, providing a topological explanation.

The paper introduces new structures for colored HOMFLY-PT invariants using skein theory.

problem Proving strong integrality and deriving symmetric properties for HOMFLY-PT invariants.
method Purely using HOMFLY-PT skein theory and applying to LMOV conjecture.
result Strong integrality and symmetric properties for colored HOMFLY-PT invariants.

We generalize results of Lee, Gornik and Wu on the structure of deformed colored sl(N) link homologies to the case of non-generic deformations. To this end, we use foam technology to give a completely combinatorial construction of Wu's deformed colored sl(N) link homologies. By studying the underlying deformed higher r…

2015-01-12abs ↗pdf ↗