English
Related papers

Related papers: On Crossing Ball Structure in Knot and Link Comple…

200 papers

The concept of complementability is extended from bounded operators to densely defined operators on Hilbert spaces. By introducing appropriate projections and decomposition techniques, a framework is developed for analyzing…

Functional Analysis · Mathematics 2025-11-27 Sachin Manjunath Naik , P. Sam Johnson

We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…

Geometric Topology · Mathematics 2020-04-07 Christine Ruey Shan Lee

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,…

q-alg · Mathematics 2008-02-03 Jan A. Kneissler

We show that if a knot or link has n thin levels when put in thin position then its exterior contains a collection of n disjoint, non-parallel, planar, meridional, essential surfaces. A corollary is that there are at least n/3 tetrahedra in…

Geometric Topology · Mathematics 2007-05-23 David Bachman

Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…

Logic · Mathematics 2012-12-04 Timothy H. McNicholl

A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of the boundary of M. We derive a…

Geometric Topology · Mathematics 2007-05-23 Jim E. Hoste , Patrick D. Shanahan

We show that if a knot admits a prime, twist-reduced diagram with at least 4 twist regions and at least 6 crossings per twist region, then every non-trivial Dehn filling of that knot is hyperbolike. A similar statement holds for links. We…

Geometric Topology · Mathematics 2014-05-20 David Futer , Jessica S. Purcell

We construct an algorithm that lists all closed essential surfaces in the complement of a knot that lies on the fiber of a trefoil or figure eight knot. Such knots are Berge knots and hence admit lens space surgeries. Furthermore they may…

Geometric Topology · Mathematics 2007-05-23 Kenneth L. Baker

We construct ribbon surfaces of Euler characteristic one for several infinite families of alternating 3-braid closures. We also use a twisted Alexander polynomial obstruction to conclude the classification of smoothly slice knots which are…

Geometric Topology · Mathematics 2023-06-22 Vitalijs Brejevs

We present new techniques to show hyperbolicity of links based on geometric/combinatorial topology. Our techniques are applicable to links that have at least one unknotted component. In particular, they are applicable to Brunnian links. We…

Geometric Topology · Mathematics 2025-08-19 Sheng Bai

We relate the author's Lie cobracket in the module additively generated by loops on a surface with the Connes-Kreimer Lie bracket in the module additively generated by trees. To this end we introduce a pre-Lie coalgebra and a (commutative)…

High Energy Physics - Theory · Physics 2009-11-10 Vladimir Turaev

Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat…

Geometric Topology · Mathematics 2018-09-07 Grace Tian

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…

Combinatorics · Mathematics 2025-01-07 Paul C. Kainen

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

Geometric Topology · Mathematics 2009-11-10 Jae-Wook Chung , Xiao-Song Lin

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…

Geometric Topology · Mathematics 2014-11-14 Matt Mastin

Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…

Combinatorics · Mathematics 2020-07-10 Christopher R. Cornwell , Nathan McNew

We show the existence of infinitely many knot exteriors where each of which contains meridional essential surfaces of any genus and (even) number of boundary components. That is, the compact surfaces that have a meridional essential…

Geometric Topology · Mathematics 2020-06-03 João M. Nogueira

When a Dehn filled link manifold contains a geometrically incompressible one-sided surface, it is shown there is a unique boundary incompressible position that the surface can take in the link space. The proof uses a version of the…

Geometric Topology · Mathematics 2008-07-31 Loretta Bartolini

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…

Geometric Topology · Mathematics 2019-10-29 Maciej Niebrzydowski

We provide an upper bound on the Cheeger constant and first eigenvalue of the Laplacian of a finite-volume hyperbolic 3-manifold M, in terms of data from any surgery diagram for M. This has several consequences. We prove that a family of…

Geometric Topology · Mathematics 2008-10-30 Marc Lackenby