Related papers: Towards effective topological field theory for kno…
Closed 3-string braids admit many bandings to two-bridge links. By way of the Montesinos Trick, this allows us to construct infinite families of knots in the connected sum of lens spaces L(r,1) # L(s,1) that admit a surgery to a lens space…
The $2$-decomposition for ribbon graphs was introduced in [Annals of Combinatorics 15 (2011), pp 675-706]. We extend this result to half-edged ribbon graphs and to rank $D$-weakly colored graphs [SIGMA 12 (2016), 030], generalizing…
We formalize the arithmetic topology, i.e. a relationship between knots and primes. Namely, using the notion of a cluster C*-algebra we construct a functor from the category of 3-dimensional manifolds M to a category of algebraic number…
We introduce and compute a 2-parameter family deformation of the A-polynomial that encodes the color dependence of the superpolynomial and that, in suitable limits, reduces to various deformations of the A-polynomial studied in the…
Simple physics ideas are used to derive an exact expression for a flat connection on the complement of a torus knot. The result is of some mathematical importance in the context of constructing representations of the knot group -- a…
Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting…
In generalization of knot quandles we introduce similar algebraic structures associated with arbitrary pairs consisting of a path-connected topological space and its path-connected subspace.
We develop homological techniques for finding explicit combinatorial expressions of finite-type cohomology classes of spaces of knots in $R^n, n \ge 3,$ generalizing Polyak--Viro formulas for invariants (i.e. 0-dimensional cohomology…
We give a topological realization of the (spherical) double affine Hecke algebra $\mathrm{SH}_{q,t}$ of type $A_1$, and we use this to construct a module over $\mathrm{SH}_{q,t}$ for any knot $K \subset S^3$. As an application, we give a…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
In this article we describe a canonical way to expand a certain kind of $(\mathbb Z_2)^{n+1}$-colored regular graphs into closed $n$-manifolds by adding cells determined by the edge-colorings inductively. We show that every closed…
We conjecture formulae of the colored superpolynomials for a class of twist knots $K_p$ where p denotes the number of full twists. The validity of the formulae is checked by applying differentials and taking special limits. Using the…
This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…
We begin the systematic study of knot polynomials for the twist satellites of a knot, when its strand is substituted by a 2-strand twist knot. This is a generalization of cabling (torus satellites), when the substitute of the strand was a…
It is known that the colored Jones polynomials of a knot in the 3-dimensional sphere satisfy recursive relations, it is also known that these recursive relations come from recurrence polynomials which have been related, by the AJ…
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
Alexander polynomial arises in the leading term of a semi-classical Melvin-Morton-Rozansky expansion of colored knot polynomials. In this work, following the opposite direction, we propose how to reconstruct colored HOMFLY-PT polynomials,…
We explore more the properties of bipartite knots and its rich combinatorial structure.
A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…