arXiv research

The paper introduces a quantum state system to count perfect matchings in graphs.

Researchers create functors to match colored homologies of knots and links.

The Penrose-Kauffman polynomial connects knot theory to graph coloring.

New link invariants from diagram colorings match link widths.

Improved algorithm for low-discrepancy colorings with practical time complexity.

Single-colored ADO-3 invariant matches Links-Gould polynomial for 5-braid closures.

The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for the colored Jones polynomial of such knots with the parameters that describe thei…

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one, implies that the perfect matching is even and therefore the graph is 4-face color…

Given a planar curve singularity, we prove a conjecture of Oblomkov-Shende, relating the geometry of its Hilbert scheme of points to the HOMFLY polynomial of the associated algebraic link. More generally, we prove an extension of this conjecture, due to Diaconescu-Hua-Soibelman, relating stable pair invariants on the c…

Quantum modularity proven for specific theta series.

Mechanisms of human color vision are characterized by two phenomenological aspects: the system is nonlinear and adaptive to changing environments. Conventional attempts to derive these features from statistics use separate arguments for each aspect. The few statistical approaches that do consider both phenomena simulta…

We present a powerful new loss function and training scheme for learning binary hash functions. In particular, we demonstrate our method by creating for the first time a neural network that outperforms state-of-the-art Haar wavelets and color layout descriptors at the task of automated scene matching. By accurately rel…

New algorithms solve partial optimal transport problems for applications like PU learning.

Paper explores properties of slice-matching operators for measure transfer.

We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident vertices. On the torus our objects are perfect pairings, whereas on the sphere this is only true after removing one triangle and its vertices.…

The paper shows links can be colored with fewer colors than previously thought.

Artificial intelligence offers the potential to automate challenging data-processing tasks in collider physics. To establish its prospects, we explore to what extent deep learning with convolutional neural networks can discriminate quark and gluon jets better than observables designed by physicists. Our approach builds…

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.…

Study on knots using 17 colors, finding specific color assignments.

It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on minimal diagrams of $\mathbb{Z}$-colorable links. We show, for any positive integer $N…

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

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

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

K. Ichihara and E. Matsudo introduced the notions of $\mathbb{Z}$-colorable links and the minimal coloring number for $\mathbb{Z}$-colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring number of a non-splittable $\mathbb{Z}$-colorable link is 4. In this paper, we sh…

Factor complexity $b_φ(n)$ for a vertex coloring $φ$ of a regular tree is the number of colored $n$-balls up to color-preserving automorphisms. Sturmian colorings are colorings of minimal unbounded factor complexity $b_φ(n) = n+2$. In this article, we prove an induction algorithm for Sturmian colorings using colored ba…

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also prove a similar result for any $11$-colorable ribbon $2$-knot.

This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…

The study characterizes torus links' coloring quivers using dihedral quandles.

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 …

Paper describes a state sum formula for a graph coloring polynomial.

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

For any link and for any modulus $m$ 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…

Introduced coloring-allowed invariants of planar knotoids with the coloring number.

Study of quandle coloring quivers with dihedral quandles.

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…

New TQFT homologies help color graphs, potentially solving the four color theorem.

The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and distribution of these points affords a quantization, through clustering, of the color i…

In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo 13 is 5.

Study shows colored Jones invariants limit to link volumes.

The paper finds 3-colorings of 2-sphere triangulations.

Study on quandle coloring quivers for (p, 2)-torus knots and links.

New colored link invariants using multi-quandles.

Paper extends Enami-Ozeki-Yamaguchi's work on planar quadrangulations.

Gradient descent with error feedback performs better than vanilla when features are rare.

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

Paper introduces new Gromov-type distances for comparing Gaussian mixture models.

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

We introduce three spectral sequences which give some expressions of colored Jones polynomials. Each spectral sequence contains a Khovanov-type homology groups. Two of them are derived from a bicomplex of the colored Jones polynomial. The other is the spectral sequence that deduces a colored Rasmussen invariant of link…