Related papers: Thin position for a connected sum of small knots

This is a chapter that is to appear in the "Handbook of Knot Theory", edited by William W. Menasco and Morwen B. Thistlethwaite.

We develop a Nitsche-based formulation for a general class of stabilized finite element methods for the Stokes problem posed on a pair of overlapping, non-matching meshes. By ex- tending the least-squares stabilization to the overlap…

We consider the question, asked by Friedl, Livingston and Zentner, of which sums of torus knots are concordant to alternating knots. After a brief analysis of the problem in its full generality, we focus on sums of two torus knots. We…

Motivated by the scalability problem in large networks, we study stability of a network of infinitely many finite-dimensional subsystems. We develop a so-called relaxed small-gain theorem for input-to-state stability (ISS) with respect to a…

We show that, under some technical conditions, the Strong Slope Conjecture proposed by Kalfagianni and Tran is closed under connect sums and cabling. As an application, we establish the Strong Slope Conjecture for graph knots.

A method is proposed to employ entangled and squeezed light for determining the position of a party and for synchronizing distant clocks. An accuracy gain over analogous protocols that employ classical resources is demonstrated and a…

There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank…

For any positive integer $g$, we completely determine the minimal genus function for $\Sigma_{g}\times T^{2}$. We show that the lower bound given by the adjunction inequality is not sharp for some class in $H_{2}(\Sigma_{g}\times T^{2})$.…

Thin coverings are a method of constructing graded-simple modules from simple (ungraded) modules. After a general discussion, we classify the thin coverings of (quasifinite) simple modules over associative algebras graded by finite abelian…

Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a…

Continuing the work of Zemke, Livingston and Allen, we consider when linear combinations of torus knots are concordant to $L$-space knots. We begin by proving Allen's conjecture for alternating torus knots. That is, we prove that a linear…

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…

We generalize certain totient functions using elementary symmetric polynomials and derive explicit product forms for the totient functions involving the second elementary symmetric sum. This work follows from the work of Toth [The Ramanujan…

We give necessary and sufficient conditions for the sum of n subspaces of a Hilbert space to be closed. We also present various properties of n-tuples of subspaces with closed sum.

In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…

We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose less restrictive assumptions on the composite objective functional considering…

We consider the reconstruction of a function on a finite subset of $\mathbb{Z}^2$ if the line sums in certain directions are prescribed. The real solutions form a linear manifold, its integer solutions a grid. First we provide an explicit…

Superlinear convergence has been an elusive goal for black-box nonsmooth optimization. Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular…

We derive a linear estimate of the signature of positive knots, in terms of their genus. As an application, we show that every knot concordance class contains at most finitely many positive knots.

In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…