Related papers: The Complexity of Shake Slice Knots

In this note, we prove a lower bound for the positive kinkiness of a closed braid which we then use to derive an estimate for the positive kinkiness of a link in terms of its Seifert system. As an application, we show that certain pretzel…

In this short note we observe that a result of Eliashberg and Polterovitch allows to use the doubly slice genus as an obstruction for a Legendrian knot to be a slice of a concordance from the trivial Legendrian knot with maximal…

We investigate the relationship between regular and decomposable Lagrangian cobordisms in $4$-dimensional symplectizations. First, we show that regular sliceness implies once-stably decomposable sliceness, and offer a stabilization-free…

We define smooth notions of concordance and sliceness for spatial graphs. We prove that sliceness of a spatial graph is equivalent to a condition on a set of linking numbers together with sliceness of a link associated to the graph. This…

In this paper, we study reducible surgeries on knots in $S^3$. We develop thickness bounds for L-space knots that admit reducible surgeries, and lower bounds on the slice genus for general knots that admit reducible surgeries. The L-space…

This paper studies twisted signature invariants and twisted linking forms, with a view towards obstructions to knot concordance. Given a knot $K$ and a representation $\rho$ of the knot group, we define a twisted signature function…

We construct infinitely many smoothly slice knots having topological slice discs that are non-approximable by smooth slice discs.

We use recently introduced Rasmussen invariant to find knots that are topologically locally-flatly slice but not smoothly slice. We note that this invariant can be used to give a combinatorial proof of the slice-Bennequin inequality.…

We give an explicit construction of linearly independent families of knots arbitrarily deep in the (n)-solvable filtration of the knot concordance group using the \rho^1-invariant. A difference between previous constructions of infinite…

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…

We introduce a 4-dimensional analogue of the rational Seifert genus of a knot $K\subset Y$, which we call the rational slice genus, that measures the complexity of a homology class in $H_2(Y\times [0,1],K;\mathbb{Q})$. Our main theorem is a…

We investigate the parameterized complexity of several problems formalizing cluster identification in graphs. In other words we ask whether a graph contains a large enough and sufficiently connected subgraph. We study here three relaxations…

It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…

In 1982 Louis Kauffman conjectured that if a knot in the 3-sphere is a slice knot then on any Seifert surface for that knot there exists a homologically essential simple closed curve of self-linking zero which is itself a slice knot, or at…

A virtual knot is an equivalence class of embeddings of $ S^1 $ into thickened (closed oriented) surfaces, up to self-diffeomorphism of the surface and certain handle stabilisations. The slice genus of a virtual knot is defined…

Is detecting a $k$-clique in $k$-partite regular (hyper-)graphs as hard as in the general case? Intuition suggests yes, but proving this -- especially for hypergraphs -- poses notable challenges. Concretely, we consider a strong notion of…

We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…

Double twist knots $K_{m, n}$ are known to be rationally slice if $mn = 0$, $n = -m\pm 1$, or $n = -m$. In this paper, we prove the converse. It is done by showing that infinitely many prime power-fold cyclic branched covers of the other…

A new complexity measure named as Lattice Complexity is presented for finite symbolic sequences. This measure is based on the symbolic dynamics of one-dimensional iterative maps and Lempel-Ziv Complexity. To make Lattice Complexity…

The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number $s_{L}(G)$ of spatial…