Related papers: Dehn coloring and the dimer model for knots
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
For a compact connected 3-submanifold with connected boundary in the 3-sphere, we relate the existence of a Seifert surface system for a surface with a Dehn surgery along a null-homologous link. As its corollary, we obtain a refinement of…
We calculate limits of the colored Jones polynomials of the figure-eight knot and conclude that in most cases they determine the volumes and the Chern--Simons invariants of the three-manifolds obtained by Dehn surgeries along it.
Since the seminal result of Karger, Motwani, and Sudan, algorithms for approximate 3-coloring have primarily centered around SDP-based rounding. However, it is likely that important combinatorial or algebraic insights are needed in order to…
We partially determine grid homology (combinatorial knot Floer homology) of diagonal knots, which are conjectured to be equivalent to positive braid knots, by exploiting nice grid diagrams. Its next-to-top term detects the number of prime…
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which respects the pre-coloring assignment. This…
We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of `qualities' or `spins' that is permuted by the gain group. (An example is the Potts model.) The number of totally…
Differential expansion (DE) for a Wilson loop average in representation $R$ is built to respect degenerations of representations for small groups. At the same time it behaves nicely under some changes of the loop, e.g. of some knots in the…
We study RNA foldings and investigate their topology using a combination of knot theory and embedded rigid vertex graphs. Knot theory has been helpful in modeling biomolecules, but classical knots place emphasis on a biomolecule's…
Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number…
It is known that knot homologies admit a physical description as spaces of open BPS states. We study operators and algebras acting on these spaces. This leads to a very rich story, which involves wall crossing phenomena, algebras of closed…
Graph coloring is a problem with varied applications in industry and science such as scheduling, resource allocation, and circuit design. The purpose of this paper is to establish if a new gradient based iterative solver framework known as…
Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…
We describe how to construct a spanning set of linearly-independent, automatically orthogonal colour tensors for scattering amplitudes involving coloured particles transforming under arbitrary representations of any gauge theory, sufficient…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
Given a hyperbolic 3-manifold with torus boundary, we bound the change in volume under a Dehn filling where all slopes have length at least 2\pi. This result is applied to give explicit diagrammatic bounds on the volumes of many knots and…
Recently, Jones introduced a method of constructing knots and links from elements of Thompson's group $F$ by using its unitary representations. He also defined several subgroups of $F$ as the stabilizer subgroups and some researchers…
We introduce the notion of a coloring of a poset, which consists of a labeling of the edges in its Hasse diagram by elements in a given group $G$. We use $G$-colorings to describe the covering maps of posets and present a new method based…
We define new invariants of knots by means of quandle colorings and longitudinal information. These invariants can be applied to a tangle embedding problem and recognizing non-classical virtual knots.