Related papers: Bipartite knots
In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded…
We solve a strong version of Problem 3.6 (D) in Kirby's list, that is, we show that for any integer $n$, there exist infinitely many mutually distinct knots such that $2$-handle additions along them with framing $n$ yield the same…
The recently suggested bipartite analysis extends the Kauffman planar decomposition to arbitrary $N$, i.e. extends it from the Jones polynomial to the HOMFLY polynomial. This provides a generic and straightforward non-perturbative calculus…
We prove that for three-manifolds satisfying a certain algebraic condition on their fundamental group, null-homotopic knots are determined by their complements. This answers a Kirby Problem posed by Boileau for this special case of…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
We give a number theoretic proof of the integrality of certain BPS invariants of knots. The formulas for these numbers are sums involving binomial coefficients and the M\"obius function. We also prove a conjecture about further divisibility…
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…
In this paper we use the connected sum operation on knots to show that there is a one-to-one relation between knots and numbers. In this relation prime knots are bijectively assigned with prime numbers such that the prime number 2…
Binary representations of the trefoil and other knots of up to ten crossings in the simple cubic lattice were created. The BiEntropy of each knot was computed using a variety of binary encodings and compared against controls. This showed…
Ng constructed an invariant of knots in ${\mathbb{R}}^3$, a combinatorial knot contact homology. Extending his study, we construct an invariant of surface-knots in ${\mathbb{R}}^4$ using marked graph diagrams.
We show that there exist knots K in S^3 with g(E(K))=2 and g(E(K#K#K))=6. Together with Theorem~1.5 of [1], this proves existence of counterexamples to Morimoto's Conjecture (Conjecture 1.5 of [2]). This is a special case of…
We construct a map from knots to (abstract) 2-knots which can be extended to higher dimensions; this map is the natural "knot" counterpart for "braid" theory of groups $G_{n}^{k}$.
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
In this paper, we construct a sequence of genus one knots that are both S-equivalent, yet can be distinguished by the Jones polynomial. This is related to the problem 1.6 in Kirby's problem list (K3).
We explore more the properties of bipartite knots and its rich combinatorial structure.
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
We give the first examples of a pair of knots $K_1$,$K_2$ in the 3-sphere for which their unknotting numbers satisfy $u(K_1\#K_2)<u(K_1)+u(K_2)$ . This answers question 1.69(B) from Kirby's problem list, "Problems in low-dimensional…