Related papers: Thin position for a connected sum of small knots
By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We classify all the relative positions between an ellipsoid and an elliptic paraboloid when the ellipsoid is small in comparison with the paraboloid ({\it small} meaning that the ellipsoid cannot be tangent to the paraboloid at two points…
In this paper, we establish a version of the adjunction inequality for closed symplectic 4-manifolds. As in a previous paper on the Thom conjecture, we use contact geometry and trisections of 4-manifolds to reduce this inequality to the…
In this paper, we study a class of problems where the sum of truncated convex functions is minimized. In statistical applications, they are commonly encountered when $\ell_0$-penalized models are fitted and usually lead to NP-Hard…
The triangulations of point configurations which decompose as a free sum are classified in terms of the triangulations of the summands. The methods employ two new kinds of partially ordered sets to be associated with any triangulation of a…
We give a short proof that if a non-trivial band sum of two knots results in a tight fibered knot, then the band sum is a connected sum. In particular, this means that any prime knot obtained by a non-trivial band sum is not tight fibered.…
We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…
Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…
We prove the volume conjecture for any twist knots by using an equivalence relation, complex analysis, analytic continuation, and function of several complex variables on the basis of colored Jones polynomials.
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
It is a well-known procedure for constructing a torus knot or link that first we prepare an unknotted torus and meridian disks in the complementary solid tori of it, and second smooth the intersections of the boundary of meridian disks…
The slicing degree of a knot $K$ is defined as the smallest integer $k$ such that $K$ is $k$-slice in $\#^n \overline{\mathbb{CP}^2}$ for some $n$. In this paper, we establish bounds for the slicing degrees of knots using Rasmussen's…
We study knots in $\mathbb{S}^3$ obtained by the intersection of a minimal surface in $\mathbb{R}^4$ with a small 3-sphere centered at a branch point. We construct examples of new minimal knots. In particular we show the existence of…
This paper is an introduction to the subject of virtual knot theory, combined with a discussion of some specific new theorems about virtual knots. The new results are as follows: We prove, using a 3-dimensional topology approach that if a…
We present a new method to derive exact cumulant expressions of any order of von Neumann entropy over Hilbert-Schmidt ensemble. The new method uncovers hidden cumulant structures that decouple each cumulant in a summation-free manner into…
In this paper, it is proved a very general well-posedness result for a class of constrained minimization problems.
This paper deals with subsampled spectral gradient methods for minimizing finite sum. Subsample function and gradient approximations are employed in order to reduce the overall computational cost of the classical spectral gradient methods.…
This paper presents smoothing schemes for obtaining approximate stationary points of unconstrained or linearly-constrained composite nonconvex-concave min-max (and hence nonsmooth) problems by applying well-known algorithms to composite…