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

Trend · papers per month

6.3%12.5%18.8%25.0% · Jul 199319922001200920182026
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.

This paper shows the minimal coloring number for certain Z\mathbb{Z}-colorable links is four.

problem Determining the minimal number of colors for Z\mathbb{Z}-colorings of links.
method Analyzing diagrams of Z\mathbb{Z}-colorable links and constructing specific diagrams to find the minimal coloring number.
result The minimal coloring number for non-splittable Z\mathbb{Z}-colorable links is four.

This paper proves the minimal coloring number for a specific type of link is exactly 4.

problem Determining the minimal coloring number for a specific type of link.
method Investigated Z\mathbb{Z}-colorable links and used their properties to prove the minimal coloring number is 4.
result The minimal coloring number of any non-splittable Z\mathbb{Z}-colorable link is exactly 4.

The paper explores minimal coloring numbers for Z\mathbb{Z}-colorable links.

problem Finding the minimum number of colors needed for Z\mathbb{Z}-colorings on minimal diagrams of Z\mathbb{Z}-colorable links.
method Investigates minimal diagrams and Z\mathbb{Z}-colorings for Z\mathbb{Z}-colorable links.
result For any positive integer NN, there exists a minimal diagram of a Z\mathbb{Z}-colorable link with at least NN colors in any Z\mathbb{Z}-coloring.

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.

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.

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 ↗

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 ↗

This paper establishes a correspondence between biquandle and quandle colorings for classical and surface links.

problem Finding refined invariants for classical and surface links using biquandles.
method Explicit one-to-one correspondence between biquandle colorings and quandle colorings.
result Biquandle homotopy invariants and quandle homotopy invariants are equivalent.

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 ↗

New method for calculating colored HOMFLY-PT polynomials for links with different symmetric representations.

problem Calculating colored HOMFLY-PT polynomials for links with arbitrary symmetric representations.
method Using quantum Racah coefficients (6j-symbols) of Uq(sl2)U_q(sl_2) to simplify the evaluation.
result Multi-colored link polynomials H[r1],[r2]H_{[r_1],[r_2]} for a specific link L7a3 are successfully evaluated.

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 ↗

Researchers found a qq-series identity for a specific knot using sl3\mathfrak{sl}_3 representations.

problem Finding a qq-series tail for sl3\mathfrak{sl}_3 colored Jones polynomials.
method Explicit formulas for the tail of sl3\mathfrak{sl}_3 colored Jones polynomials for (2,2m)(2,2m)-torus links.
result An identity of qq-series connecting sl3\mathfrak{sl}_3 colored Jones polynomials and Ramanujan false theta function.

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.

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.