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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920182026
48 results for prime colorings

The paper proves a generalized Kauffman-Harary conjecture for prime determinant links.

problem Proving a generalized Kauffman-Harary conjecture for prime determinant links.
method Using Fox colorings and properties of reduced alternating diagrams.
result For every pair of distinct arcs in a prime determinant link, there exists a Fox coloring that distinguishes them.

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a link and the modulus r is 2, 3, 5, or 7, then the minimum number of colors is 2…

2010-01-08abs ↗pdf ↗

In this article we present the following new fact for prime p=11. For knots 6_2 and 7_2, mincol_{11} 6_2 = 5 = mincol_{11} 7_2, along with the following feature. There is a pair of diagrams, one for 6_2 and the other one for 7_2, each of them admitting only non-trivial 11-colorings using 5 colors, but neither of them a…

2013-08-28abs ↗pdf ↗

For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. This expression is t + 2 l -1 where t and l are extracted from the prime p. It is obtained from iterating the so-called Teneva transformations…

2012-04-23abs ↗pdf ↗

The paper finds minimum Dehn colors for knots and defines useful graphs for coloring.

problem Finding the minimum number of colors for Dehn colorings of knots.
method Analyzes Dehn colorings for knots and defines R\R-palette graphs.
result For Dehn pp-colorable knots, the minimum number of colors is at least log2pfloor+2\lfloor \log_2 p floor +2.

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 ↗

Study of quandle coloring quivers with dihedral quandles.

problem Link invariants and their enhancements using quandles.
method Introduced shadow quandle coloring quivers and cocycle quivers, studied equivalence with quandle coloring numbers and shadow quandle cocycle invariants.
result Equivalence of quandle coloring quivers with quandle coloring numbers and shadow quandle cocycle quivers with shadow quandle cocycle invariants for specific dihedral quandles.

This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in the sense that if a diagram of the knot under study admits such a coloring, then …

2017-08-06abs ↗pdf ↗

We prove the Kauffman-Harary Conjecture, posed in 1999: given a reduced, alternating diagram D of a knot with prime determinant p, every non-trivial Fox p-coloring of D will assign different colors to different arcs.

2009-06-08abs ↗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 present a set of 26 finite quandles that distinguish (up to reversal and mirror image) by number of colorings, all of the 2977 prime oriented knots with up to 12 crossings. We also show that 1058 of these knots can be distinguished from their mirror images by the number of colorings by quandles from a certain set of…

2013-12-11abs ↗pdf ↗

In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proofs of mincol_p L \geq 5 for p \geq 11 and mincol_p L \geq 6 for p \geq 17. We elaborate on equivalence classes of sets of distinct colors (o…

2015-01-11abs ↗pdf ↗

The Kauffman-Harary conjecture states that for any reduced alternating diagram K of a knot with a prime determinant p, every non-trivial Fox p-coloring of K assigns different colors to its arcs. We generalize the conjecture by stating it in terms of homology of the double cover of S^3 branched along a link. In this way…

2003-05-29abs ↗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.

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 ↗

Study volume conjecture for links with multiple hyperbolic pieces.

problem Volume conjecture for links with more than one hyperbolic piece.
method Constructing infinite families of prime links, analyzing their complements, and using colored Jones polynomials and simplicial volume.
result Exponential growth rates of colored Jones polynomials capture the simplicial volume of link complements.

The pair (K,r) consisting of a knot K and a surjective map r from the knot group onto a dihedral group is said to be a p-colored knot. D. Moskovich conjectured that for any odd prime p there are exactly p equivalence classes of p-colored knots up to surgery along unknots in the kernel of the coloring. We show that ther…

2007-09-10abs ↗pdf ↗

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.

The paper connects ADO polynomials to Vassiliev invariants for knots.

problem Connecting ADO polynomials to Vassiliev invariants for knots.
method Exploiting the colored Jones polynomials and their decomposition as Vassiliev invariants, the authors transpose this to ADO polynomials.
result A unique computable expansion of ADO polynomials as Vassiliev invariants.

We reveal an intimate connection between the quantum knot invariant for torus knot T(s,t) and the character of the minimal model M(s,t), where s and t are relatively prime integers. We show that Kashaev's invariant, i.e., the N-colored Jones polynomial at the N-th root of unity, coincides with the Eichler integral of t…

2003-08-22abs ↗pdf ↗

Let p be an odd prime and r be relatively prime to p. Let G be a finite p-group. Suppose an oriented 3-manifold M-tilde has a free G-action with orbit space M. We consider certain Witten-Reshetikhin-Turaev SU(2) invariants w_r(M). We will give a fomula for w_r(M) in terms of the defect of M-tilde --> M and the number o…

1999-02-21abs ↗pdf ↗

In 1999, Kauffman-Harary conjectured that every non-trivial Fox pp-coloring of a reduced, alternating knot diagram with prime determinant pp is heterogeneous. Ten years later this conjecture was proved by W. Mattman and P. Solis. Mathew Williamson generalized this conjecture to alternating virtual knots and proved it…

2013-10-16abs ↗pdf ↗

Budney recently constructed an operad that encodes splicing of knots. He further showed that the space of (long) knots is generated over this operad by the space of torus knots and hyperbolic knots, thus generalizing the satellite decomposition of knots from isotopy classes to the level of the space of knots. Infection…

2013-11-17abs ↗pdf ↗

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers occur as determinants of prime alternating achiral knots, and obtain a complete re…

2000-03-27abs ↗pdf ↗

We give a construction of quandle cocycles from group cocycles, especially, for any integer p \geq 3, quandle cocycles of the dihedral quandle R_p from group cocycles of the cyclic group Z/p. We will show that a group 3-cocycle of Z/p gives rise to a non-trivial quandle 3-cocycle of R_p. When p is an odd prime, since d…

2010-12-16abs ↗pdf ↗

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 ↗

Decomposes prime alternating links into prime tangles.

problem Understanding how to decompose prime alternating links into prime tangles.
method Refined results from Menasco and Thistlethwaite, focusing on alternating property and pseudo-Montesinos links.
result If a prime alternating link can be decomposed into two prime tangles, it must be visible in an alternating link diagram or the link is pseudo-Montesinos.

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.

The main purpose of this note is the study of the total space of a holomorphic Lie algebroid EE. The paper is structured in three parts. In the first section we briefly introduce basic notions on holomorphic Lie algebroids. The local expressions are written and the complexified holomorphic bundle is introduced. The se…

2016-05-26abs ↗pdf ↗