arXiv research

The minimum number of colors is a challenging knot invariant since, by definition, its calculation requires taking the minimum over infinitely many minima. In this article we estimate and in some cases calculate the minimum number of colors for the Turk's head knots on three strands.

The paper finds minimum Dehn colors for knots and defines useful graphs for coloring.

Computed minimum crossing numbers for Turaev genus 2 links.

The paper calculates minimum Dehn colors for knots using symmetric local biquandle cocycles.

Even knots with more than 30 crossings are not fertile.

Study on folded ribbon knots and their minimum length.

Links with minimum tunnel number have one less component than their number of parts.

The paper calculates genus bounds for multibranched surfaces.

Study shows how networks converge to minimum norm solutions with regularization.

In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted stri…

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a link and the modulus r is 2, 3, 5, or 7, then the minimum number of colors is 2…

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 braids to study graph trees, amphicheirality, unknotting numbers, and periodic table…

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (…

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly embedded in 4-dimensional ball, bounding the knot. Clearly the 4-dimensional crosscap …

Paper shows minimum 10 vertices for hyperbolic origami 2-torus.

In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo 13 is 5.

We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed plane curve $γ$ such that the minimum area of a null homotopy of $2\cdotγ$ is l…

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it equals the minimum number of Goda-Scharlemann-Thompson tunnel moves needed to con…

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $Σ$, including the minimum number of self-intersections, the minimum length of the words representing them in a geometric presentation of $π_1(Σ)$, and the minimum degree of the coverings of $Σ$ to which …

Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to realize a molecular knot. The minimum lattice length $\mbox{Len}(K)$ of a knot $K$ i…

For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. This expression is t + 2 l -1 where t and l are extracted from the prime p. It is obtained from iterating the so-called Teneva transformations…

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

The calculation of minimum energy paths for transitions such as atomic and/or spin re-arrangements is an important task in many contexts and can often be used to determine the mechanism and rate of transitions. An important challenge is to reduce the computational effort in such calculations, especially when ab initio …

We extend techniques due to Pardon to show that there is a lower bound on the distortion of a knot in $\mathbb{R}^3$ proportional to the minimum of the bridge distance and the bridge number of the knot. We also exhibit an infinite family of knots for which the minimum of the bridge distance and the bridge number is unb…

A new knot invariant measures crossings in three orthogonal directions.

Paper shows that for torus knots, the pinch number equals the unoriented band unknotting number.

Consider the problem of estimating the minimum entropy of pseudo-Anosov maps on a surface of genus $g$ with $n$ punctures. We determine the behaviour of this minimum number for a certain large subset of the $(g,n)$ plane, up to a multiplicative constant. In particular it has been shown that for fixed $n$, this minimum …

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum number of vertices is $3d$; otherwise, it is $3d+2$. Similar results apply to al…

New measure shows how links can be untangled as twists increase.

Originally, the SW-equations discovered by Seiberg-Witten are 1st-order PDE, which solutions (A,φ), with φ\ne 0, are known as SW-monopoles. It is known that the solutions of these 1st-order eq correspond to the minimum of SW-functional. However, it is not true, that for all spin^{c} class α, the minimum is always attai…

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

Study on inflection points of plane curve shadows with fixed embedded shapes.

New K3 surfaces with two involutions and low Picard number constructed.

We study risk of the minimum norm linear least squares estimator in when the number of parameters $d$ depends on $n$, and $\frac{d}{n} \rightarrow \infty$. We assume that data has an underlying low rank structure by restricting ourselves to spike covariance matrices, where a fixed finite number of eigenvalues grow with…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related knots.

Origami can create complex knots, with minimum creases defining a new knot invariant.

Study minimum ribbonlength of immersed flat knots and links.

New NTK bounds show deep networks with minimum over-parameterization can still memorize and optimize.

We analyze single-layer neural networks with the Xavier initialization in the asymptotic regime of large numbers of hidden units and large numbers of stochastic gradient descent training steps. The evolution of the neural network during training can be viewed as a stochastic system and, using techniques from stochastic…

Delta-unlinking number measures how to unlink algebraically split links.

Unified proof of knot unknotting bounds using Ma-Qiu index.

We consider non-orientable closed surfaces of minimum crosscap number in the $(p,q)$-lens space $L(p,q) \cong V_1 \cup_{\partial} V_2$, where $V_1$ and $V_2$ are solid tori. Bredon and Wood gave a formula for calculating the minimum crosscap number. Rubinstein showed that $L(p,q)$ with $p$ even has only one isotopy cla…

Throughout the history of Einstein manifolds, differential geometers have shown great interest in finding the relationships between curvature and the topology of Einstein manifolds. In the paper, first, we prove that a compact Einstein manifold $(M,g)$ with Einstein constant $α>0$ is a homo-logical sphere when the mini…

We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on …

Neural networks generalize on simple data generated by a programming language.

New methods for delta-moves on algebraically split links identified.