Related papers: Alternating knots, planar graphs and q-series

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

We discuss different invariants of knots and links that depend on a primitive root of unity. We clarify the definitions of existing invariants with the Reshetikhin-Turaev method, present the generalization of ADO invariants to…

We give an account of well known calculations of the RO(Q)-graded coefficient rings of some of the most basic Q-equivariant cohomology theories, where Q is a group of order 2. One purpose is to advertise the effectiveness of the Tate…

In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…

Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to…

For integer q>1, we derive edge q-colouring models for (i) the Tutte polynomial of a graph G on the hyperbola H_q, (ii) the symmetric weight enumerator of the set of group-valued q-flows of G, and (iii) a more general vertex colouring model…

We propose a new method to enumerate alternating knots using a transfer matrix approach. We apply it to count numerically various objects, including prime alternating tangles with two connected components, up to order 18--22, and comment on…

We describe rules for computing a homology theory of knots and links in $\mathbb{R}^3$. It is derived from the theory of framed BPS states bound to domain walls separating two-dimensional Landau-Ginzburg models with (2,2) supersymmetry. We…

We construct a topological invariant of algebraic plane curves, which is in some sense an adaptation of the linking number of knot theory. This invariant is shown to be a generalization of the I-invariant of line arrangements developed by…

Let $D$ be a diagram of an alternating knot with unknotting number one. The branched double cover of $S^3$ branched over $D$ is an L-space obtained by half integral surgery on a knot $K_D$. We denote the set of all such knots $K_D$ by…

We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the…

We prove that for knots, the evaluation of the Jones polynomial at the sixth root of unity, as well as the evaluation of the $Q$-polynomial at the reciprocal of the golden ratio, are uniquely determined by the oriented homeomorphism type of…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…

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.

Let $k,p,q$ be three positive integers. A graph $G$ with order $n$ is said to be $k$-placeable if there are $k$ edge disjoint copies of $G$ in the complete graph on $n$ vertices. A $(p,\,q)$-graph is a graph of order $p$ with $q$ edges.…

We prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.

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

Our paper originated from a generalization of the Volume Conjecture to multisums of $q$-hypergeometric terms. This generalization was sketched by Kontsevich in a problem list in Aarhus University in 2006; \cite{Ko}. We introduce the notion…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…