Related papers: Petal diagram from simple braids

We determine the set of all genus g bridge numbers of many iterated torus knots, listing these numbers in a sequence called the bridge spectrum. In addition, we prove a structural lemma about the decomposition of a strongly irreducible…

From the link Floer complex of a link $K$, we extract a lower bound $t_q'(K)$ for the rational unknotting number of $K$ (i.e. the minimum number of rational replacements required to unknot $K$). Moreover, we show that the torsion…

By examining knot Floer homology, we extend a result of Ozsv\'ath and Stipsicz and show further infinitely many Legendrian and transversely non-simple knot types among two-bridge knots. We give sufficient conditions of Legendrian and…

A theorem of Kronheimer and Mrowka states that Khovanov homology is able to detect the unknot. That is, if a knot has the Khovanov homology of the unknot, then it is equivalent to it. Similar results hold for the trefoils and the…

We study the AJ conjecture that relates the A-polynomial and the colored Jones polynomial of a knot in $S^3$. We confirm the AJ conjecture for $(r,2)$-cables of the $m$-twist knot, for all odd integers $r$ satisfying $\begin{cases}…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

The explicit formula, which expresses the Alexander polynomials \Delta_{n,3}(t) of torus knots T(n,3) as a sum of the Alexander polynomials \Delta_{k,2}(t) of torus knots T(k,2), is found. Using this result and those from our previous…

Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…

We study certain linear representations of the knot group that induce augmentations of knot contact homology. This perspective on augmentations enhances our understanding of the relationship between the augmentation polynomial and the…

We show that every non-trivial tame knot or link in R^3 has a quadrisecant, i.e. four collinear points. The quadrisecant must be topologically non-trivial in a precise sense. As an application, we show that a nonsingular, algebraic surface…

Let $T$ be a satellite knot, link, or spatial graph in a 3-manifold $M$ that is either $S^3$ or a lens space. Let $\mathfrak{b}_0$ and $\mathfrak{b}_1$ denote genus 0 and genus 1 bridge number, respectively. Suppose that $T$ has a companion…

A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is crossed more than $k$ times. In this paper, we explore the relationship between $k$-planarity and…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

The stable Khovanov-Rozansky homology of torus knots has been conjecturally described as the Koszul homology of an explicit non-regular sequence of polynomials. We verify this conjecture against newly available computational data for…

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I…

We provide new evidence that the tangle calculus and "evolution" are applicable to the Khovanov polynomials for families of long braids inside the knot diagram. We show that jumps in evolution, peculiar for superpolynomials, are much less…

Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…

The AJ conjecture relates the A-polynomial and the colored Jones polynomial of a knot in the 3-sphere. It has been verified for some classes of knots, including all torus knots, most double twist knots, (-2,3,6n \pm 1)-pretzel knots, and…