arXiv subjects

John M Sullivan

Publications and source records attributed to John M Sullivan.

11 recordsLinked to original sources

arXiv2009

Criticality for the Gehring link problem

In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In this paper we refine Gehring's problem to deal with links in a fixed link-homotopy class: we prove ropelength minimizers exist and introduce a theory of ropelength criticality. Our balance criterion is a set of necessary and sufficient conditions for criticality, based on a strengthened, infinite-dimensional version of the Kuhn--Tucker theorem. We use this to prove that every critical link is C^1 with finite total curvature. The balance criterion also allows us to explicitly describe critical configurations (and presumed minimizers) for many links including the Borromean rings. We also exhibit a surprising critical configuration for two clasped ropes: near their tips the curvature is unbounded and a small gap appears between the two components. These examples reveal the depth and richness hidden in Gehring's problem and our natural extension.

math.DG↗

arXiv2009

Quadrisecants give new lower bounds for the ropelength of a knot

Using the existence of a special quadrisecant line, we show the ropelength of any nontrivial knot is at least 15.66. This improves the previously known lower bound of 12. Numerical experiments have found a trefoil with ropelength less than 16.372, so our new bounds are quite sharp.

math.GT↗

arXiv2007

The Distortion of a Knotted Curve

The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least 5pi/3; examples show that distortion under 7.16 suffices to build a trefoil knot. Our argument uses the existence of a shortest essential secant and a characterization of borderline-essential arcs.

math.GT↗

arXiv2007

Curves of Finite Total Curvature

We consider the class of curves of finite total curvature, as introduced by Milnor. This is a natural class for variational problems and geometric knot theory, and since it includes both smooth and polygonal curves, its study shows us connections between discrete and differential geometry. To explore these ideas, we consider theorems of Fary/Milnor, Schur, Chakerian and Wienholtz.

math.GT↗

arXiv2007

Convergence and isotopy type for graphs of finite total curvature

Generalizing Milnor's result that an FTC (finite total curvature) knot has an isotopic inscribed polygon, we show that any two nearby knotted FTC graphs are isotopic by a small isotopy. We also show how to obtain sharper constants when the starting curve is smooth. We apply our main theorem to prove a limiting result for essential subarcs of a knot.

math.GT↗

arXiv2006

When Soap Bubbles Collide

Can you fill R^n with a froth of "soap bubbles" that meet at most n at a time? Not if they have bounded diameter, as follows from Lebesgue's Covering Theorem. We provide some related results and conjectures.

math.DG↗

arXiv2003

Triunduloids: Embedded constant mean curvature surfaces with three ends and genus zero

In 1841, Delaunay constructed the embedded surfaces of revolution with constant mean curvature (CMC); these unduloids have genus zero and are now known to be the only embedded CMC surfaces with two ends and finite genus. Here, we construct the complete family of embedded CMC surfaces with three ends and genus zero; they are classified using their asymptotic necksizes. We work in a class slightly more general than embedded surfaces, namely immersed surfaces which bound an immersed three-manifold, as introduced by Alexandrov.

math.DG↗

arXiv2002

Cubic Polyhedra

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal surfaces (under an appropriate smoothing flow, keeping their symmetries). Here we give a complete classification of the cubic polyhedra. Among these are five new infinite uniform polyhedra and an uncountable collection of new infinite semi-regular polyhedra. We also consider the somewhat larger class of all discrete minimal surfaces in the cubic lattice.

math.MG↗

arXiv2002

The Second Hull of a Knotted Curve

The convex hull of a set K in space consists of points which are, in a certain sense, "surrounded" by K. When K is a closed curve, we define its higher hulls, consisting of points which are "multiply surrounded" by the curve. Our main theorem shows that if a curve is knotted then it has a nonempty second hull. This provides a new proof of the Fary/Milnor theorem that every knotted curve has total curvature at least 4pi.

math.GT↗

arXiv2002

Approximating Ropelength by Energy Functions

The ropelength of a knot is the quotient of its length by its thickness. We consider a family of energy functions for knots, depending on a power p, which approach ropelength as p increases. We describe a numerically computed trefoil knot which seems to be a local minimum for ropelength; there are nearby critical points for the p-energies, which are evidently local minima for large enough p.

math.GT↗

arXiv2001

On the Minimum Ropelength of Knots and Links

The ropelength of a knot is the quotient of its length and its thickness, the radius of the largest embedded normal tube around the knot. We prove existence and regularity for ropelength minimizers in any knot or link type; these are $C^{1,1}$ curves, but need not be smoother. We improve the lower bound for the ropelength of a nontrivial knot, and establish new ropelength bounds for small knots and links, including some which are sharp.

math.GT↗