arXiv research

Abby Thompson proved that if a link $K$ is in thin position but not in bridge position then the knot complement contains an essential meridional planar surface, and she asked whether some thin level surface must be essential. This note is to give a positive answer to this question, showing that the if a link is in thin…

We define a new notion of thin position for a graph in a 3-manifold which combines the ideas of thin position for manifolds first originated by Scharlemann and Thompson with the idea of thin position for knots first originated by Gabai. This thin position has the property that connect summing annuli and pairs-of-pants …

If a tangle, K, in the 3-ball has no planar, meridional, essential surfaces in its exterior then thin position for K has no thin levels.

Let k be a knot in S3. In [8], H.N. Howards and J. Schultens introduced a method to construct a manifold decomposition of double branched cover of (S3, k) from a thin position of k. In this article, we will prove that if a thin position of k induces a thin decomposition of double branched cover of (S3,k) by Howards and…

We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…

We give a method for searching for thin positions of a given link.

We show that every thin position for a connected sum of small knots is obtained in an obvious way: place each summand in thin position so that no two summands intersect the same level surface, then connect the lowest minimum of each summand to the highest maximum of the adjacent summand below.

We unify the notions of thin position for knots and for 3-manifolds and survey recent work concerning these notions.

We generalize the definition of thin position of Scharlemann and Thompson for compact orientable 3-manifolds with torus boundary components and introduce $α$-sloped generalized Heegaard splittings. We examine its relationship to generalized Heegaard splittings of manifolds resulting from Dehn filling. We compare alpha-…

We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.

This paper generalizes the definition of a Heegaard splitting to unify Scharlemann and Thomspon's concept of thin position for 3-manifolds, Gabai's thin position for knots, and Rubinstein's almost normal surface theory. This gives generalizations of theorems of Scharlemann, Thompson, Rubinstein, and Stocking. In the fi…

In this paper, we give an algorithm to build all compact orientable atoroidal Haken 3-manifolds with tori boundary or closed orientable Haken 3-manifolds, so that in both cases, there are embedded closed orientable separating incompressible surfaces which are not tori. Next, such incompressible surfaces are related to …

New proof of Haken's Lemma and Scharlemann's theorem using thin position.

Let L be a link in the 3-sphere that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks that P can have, including identifying thin spheres with unique compressing disks. We also give con…

We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of Thompson to graphs. It follows that any graph complement always contains a useful p…

We examine geometric properties of a knot J that are unchanged by taking a (p,q)-cable K of J. Specifically, we relate w(K) to w(J), where w(K) is the width of K in the sense of Gabai. We use this information to demonstrate that thin position is a minimal bridge position of J if and only if the same is true for K, and …

We define combinatorial analogues of stable and unstable minimal surfaces in the setting of weighted pseudomanifolds. We prove that, under mild conditions, such combinatorial minimal surfaces always exist. We use a technique, adapted from work of Johnson and Thompson, called thin position. Thin position is defined usin…

Wu has shown that if a link or a knot $L$ in $S^3$ in thin position has thin spheres, then the thin sphere of lowest width is an essential surface in the link complement. In this paper we show that if we further assume that $L \subset S^3$ is prime, then the thin sphere of lowest width also does not have any vertical c…

Motivated by M. Scharlemann and A. Thompson's definition of thin position of 3-manifolds, we define the width of a handle decomposition a 4-manifold and introduce the notion of thin position of a compact smooth 4-manifold. We determine all manifolds having width equal to $\{1,\dots, 1\}$, and give a relation between th…

We study trivalent graphs in $S^{3}$ whose closed complement is a genus two handlebody. We show that such a graph, when put in thin position, has a simple (i. e. non-loop) level edge.

It is a consequence of theorems of Gordon-Reid [Tangle decompositions of tunnel number one knots and links, J. Knot Theory and its Ramifications, 4 (1995) 389-409] and Thompson [Thin position and bridge number for knots in the 3-sphere, Topology, 36 (1997) 505-507] that a tunnel number one knot, if put in thin position…

A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a distance or similarity metric on the points, then look for highly connected subgra…

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 any triangulation of the complement of such a knot.

Signature uniquely identifies piecewise linear surfaces up to thin homotopy.

Thin position for knots in the 3-sphere was introduced by Gabai and has been used in a variety of contexts. We conjecture an analogue to a theorem of Schubert and Schultens concerning the bridge number of satellite knots. For a satellite knot K, we use the companion torus T to provide a lower bound for w(K), proving th…

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

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $Γ$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,Γ)$-c-weakly reducible in the complement of $T$ then either a "degenerate" situation occurs or $H$ can be untelescop…

Study on equivariant Heegaard genus of reducible 3-manifolds with group actions.

We extend the notion of thin multiple Heegaard splittings of a link in a 3-manifold to take into consideration not only compressing disks but also cut-disks for the Heegaard surfaces. We prove that if H is a c-strongly compressible bridge surface for a link K contained in a closed orientable irreducible 3-manifold M th…

In this paper, we investigate three geometrical invariants of knots, the height, the trunk and the representativity. First, we give a conterexample for the conjecture which states that the height is additive under connected sum of knots. We also define the minimal height of a knot and give a potential example which has…

J. Hempel's definition of the distance of a Heegaard surface generalizes to a complexity for a knot which is in bridge position with respect to a Heegaard surface. Our main result is that the distance of a knot in bridge position is bounded above by twice the genus, plus the number of boundary components, of an essenti…

A regular circle-valued Morse function on the knot complement C(K) = S^3\K is a function f from C(K) to S^1 which separates critical points and which behaves nicely in a neighborhood of the knot. Such a function induces a handle decomposition on the knot exterior E(K) = S^3\N (K), with the property that every regular l…

The paper examines rigidity of thin domains under specific boundary conditions.

New proof shows most thin knots satisfy Cabling Conjecture.

The study counts units and eigenvalue patterns in SL_n(Z) and Sp_{2n}(Z) in thin tubes.

The paper finds many thin subgroups isomorphic to Gromov-Piatetski-Shapiro lattices.

The reduced thin-sandwich equations (RTSE) appear within Wheeler's thin-sandwich approach towards the Einstein constraint equations (ECE) of general relativity. It is known that these equations cannot be well-posed in general, but, on closed manifolds, sufficient conditions for well-posedness have been established. In …

We describe a natural decomposition of a normal complex surface singularity $(X,0)$ into its "thick" and "thin" parts. The former is essentially metrically conical, while the latter shrinks rapidly in thickness as it approaches the origin. The thin part is empty if and only if the singularity is metrically conical; the…

In this paper, we study the existence and non-existence result of positive solutions to a singular elliptic equation with negative power on the bounded smooth domain or in the whole Euclidean space. Our model arises in the study of the steady states of thin films and other applied physics. We can get some useful local …

New method characterizes thin links via Conway spheres and tangle decompositions.

Regularized Stein thinning improves MCMC output approximations.

Thin groups found in specific lattices.

KSD Thinning uses KSD to thin MCMC samples efficiently.

Data thinning splits observations into independent parts for convolution-closed distributions.

Kernel thinning compresses distributions more effectively than i.i.d. sampling or standard thinning.

Generalizes data thinning for various distributions.

New method reduces summary points for datasets while maintaining quality.

Proposes efficient training method for deep thin networks.