English
Related papers

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

200 papers

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

Quantum Physics · Physics 2020-05-26 Pavel Exner , Ondřej Turek

For every link $L$ we construct a complex algebraic plane curve that intersects $S^3$ transversally in a link $\tilde{L}$ that contains $L$ as a sublink. This construction proves that every link $L$ is the sublink of a quasipositive link…

Geometric Topology · Mathematics 2019-07-25 Benjamin Bode

Knot Theory is currently a very broad field. Even a long survey can only cover a narrow area. Here we concentrate on the path from Goeritz matrices to quasi-alternating links. On the way, we often stray from the main road and tell related…

Geometric Topology · Mathematics 2009-09-08 Jozef H. Przytycki

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

Geometric Topology · Mathematics 2018-12-03 Yoav Moriah , Jessica S. Purcell

This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.

General Topology · Mathematics 2007-05-23 Louis H. Kauffman

We characterise the quintic (i.e. 5-regular) multigraphs with the property that every edge lies in a triangle. Such a graph is either from a set of small graphs or is formed by adding a perfect matching to a line graph of a cubic graph as…

Combinatorics · Mathematics 2021-07-09 James Preen

Mazur, Kapranov, Reznikov, and others developed ``Arithmetic Topology,'' a theory describing some surprising analogies between 3-dimensional topology and number theory, which can be summarized by saying that knots are like prime numbers. We…

Geometric Topology · Mathematics 2015-05-27 Adam S. Sikora

The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial…

Combinatorics · Mathematics 2014-11-18 Jie Ma , Humberto Naves

Let $G$ be a simple, connected graph on $n$ vertices, and further assume that $G$ has disjoint cycles. Let $h$ be a real symmetric matrix supported on $G$ (for example, a discrete Schr\"odinger operator). The eigenvalues of $h$ are ordered…

Mathematical Physics · Physics 2024-03-05 Lior Alon , Mark Goresky

Let $k\ge 1$ be an odd integer, $t=\lfloor {{k+2}\over 4}\rfloor$, and $q$ be a prime power. We construct a bipartite, $q$-regular, edge-transitive graph $C\!D(k,q)$ of order $v \le 2q^{k-t+1}$ and girth $g \ge k+5$. If $e$ is the the…

Combinatorics · Mathematics 2016-09-06 Felix Lazebnik , Vasiliy A. Ustimenko , Andrew J. Woldar

In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy.…

Geometric Topology · Mathematics 2016-10-19 Mark C. Hughes

We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…

Geometric Topology · Mathematics 2018-07-02 Cole Hugelmeyer

We show that if the branched double cover of an alternating link arises as $p/q \in \mathbb{Q} \setminus \mathbb{Z}$ surgery on a knot in $S^3$, then this is exhibited by a rational tangle replacement in an alternating diagram.

Geometric Topology · Mathematics 2017-05-17 Duncan McCoy

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

Combinatorics · Mathematics 2007-05-23 Remco van der Hofstad , Joel Spencer

The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…

Geometric Topology · Mathematics 2007-12-14 E. Piña

Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…

Geometric Topology · Mathematics 2018-04-30 Harrison Chapman

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

Combinatorics · Mathematics 2014-03-13 Shu-Yu Cui , Gui-Xian Tian

A knot $K$ in $S^3$ is $q$-periodic if it admits a symmetry that is conjugate to a rotation of order $q$ of $S^3$. If $K$ admits a symmetry which is a homeomorphism without fixed point of period $q$ of $S^3$, then $K$ is called freely…

Geometric Topology · Mathematics 2022-11-23 Antonio F. Costa , Cam Van Quach Hongler

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…

Geometric Topology · Mathematics 2016-11-26 Michael Brandenbursky

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

Data Structures and Algorithms · Computer Science 2025-08-15 Samuel Humeau , Damien Pous