Related papers: Quadrisecants give new lower bounds for the ropele…
We classify knot traces with trisection genus at most 2. We give infinitely many knots whose traces have trisection genus 3, and infinitely many knots whose traces have trisection genus 4. We also show that there exist infinite families of…
This note gives a lower bound of $\Omega(n^{\lceil 2d/3\rceil})$ on the maximal complexity of the Euclidean Voronoi diagram of $n$ non-intersecting lines in $\mathbb{R}^d$ for $d>2$.
The slice-Bennequin inequality states an upper bound for the self-linking number of a knot in terms of its four-ball genus. The $s$-Bennequin and $\tau$-Bennequin inequalities provide upper bounds on the self-linking number of a knot in…
In this paper, we develop a lower bound for the double slice genus of a knot using Casson-Gordon invariants. As an application, we show that the double slice genus can be arbitrarily larger than twice the slice genus. As an analogue to the…
Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…
We prove that a special alternating knot does not decompose as a non-trivial band sum. This restricts concordances from special alternating knots, and we conjecture that special alternating knots are ribbon concordance minimal. We verify…
In distinction to the Neumann case the squeezing limit of a Dirichlet network leads in the threshold region generically to a quantum graph with disconnected edges, exceptions may come from threshold resonances. Our main point in this paper…
For a given knot, we study the minimal number of positive eigenvalues of the double branched cover over spanning surfaces for the knot. The value gives a lower bound for various genera, the dealternating number and the alternation number of…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
The thickness, NIR(K) of a knot or link K is defined to be the radius of the largest solid tube one can put around the curve without any self intersections, which is also known as the normal injectivity radius of K. For C^{1,1} curves K,…
In this paper, two lower bounds on the diameters of the boundary slope sets are given for Montesinos knots. One is described in terms of the minimal crossing numbers of the knots, and the other is related to the Euler characteristics of…
Hyperfinite knots, or limits of equivalence classes of knots induced by a knot invariant taking values in a metric space, were introduced in a previous article by the author. In this article, we present new examples of hyperfinite knots…
In this paper the number and lengths of minimal length lattice knots confined to slabs of width $L$, is determined. Our data on minimal length verify the results by Sharein et.al. (2011) for the similar problem, expect in a single case,…
This paper presents evidence supporting the surprising conjecture that in the topological category the slice genus of a satellite knot $P(K)$ is bounded above by the sum of the slice genera of $K$ and $P(U)$. Our main result establishes…
A veritable zoo of different knots is seen in the ensemble of looped polymer chains, whether created computationally or observed in vitro. At short loop lengths, the spectrum of knots is dominated by the trivial knot (unknot). The…
Ribbons are long narrow strips possessing three distinct material length scales (thickness, width, and length) which allow them to produce unique shapes unobtainable by wires or filaments. For example when a ribbon has half a twist and is…
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and…
We derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute…
We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…
In this paper, we investigate the minimal length of chains of minimal rational curves needed to join two general points on a Fano manifold of Picard number 1. In particular, we give a sharp bound of the length by a fundamental argument. As…