Related papers: Alternating knots, planar graphs and q-series
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…
A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimization goal is to determine the queue number of a graph, i.e.,…
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity,…
This paper proposes the definition of a quantum knot as a linear superposition of classical knots in three dimensional space. The definition is constructed and examples are discussed. Then the paper details extensions and also limitations…
We propose a new gauge theory of quantum electrodynamics (QED) and quantum chromodynamics (QCD) from which we derive knot invariants such as the Jones polynomial. Our approach is inspired by the work of Witten who derived knot invariants…
We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…
We apply the quotient graph theory described by Band, Berkolaiko, Joyner and Liu to particular graphs symmetric with respect to $S_3$ and $C_3$ symmetry groups. We find the quotient graphs for the three-edge star quantum graph with Neumann…
Using a general $q$-series expansion, we derive some nontrivial $q$-formulas involving many infinite products. A multitude of Hecke--type series identities are derived. Some general formulas for sums of any number of squares are given. A…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…
We introduce a three variable series invariant $F_K (y,z,q)$ for plumbed knot complements associated with a Lie superalgebra $sl(2|1)$. The invariant is a generalization of the $sl(2|1)$-series invariant $\hat{Z}(q)$ for closed 3-manifolds…
We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…
We discuss the basic problem of signal transmission in quantum mechanics in terms of topological theories. Using the analogy between knot diagrams and quantum amplitudes we calculate the transmission coefficients of the concept topological…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and product of edge multiplicities in an (s,q)-graph on n vertices.…
Surgery on a knot in $S^3$ is said to be an alternating surgery if it yields the double branched cover of an alternating link. The main theoretical contribution is to show that the set of alternating surgery slopes is algorithmically…
We highlight the role of q-series techniques in proving identities arising from knot theory. In particular, we prove Rogers-Ramanujan type identities for alternating knots as conjectured by Garoufalidis, Le and Zagier.
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications for realizing all knots and links as special types of…