Criticality for the Gehring link problem

Mathematics – Differential Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is the version published by Geometry & Topology on 14 November 2006

Scientific paper

10.2140/gt.2006.10.2055

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Criticality for the Gehring link problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Criticality for the Gehring link problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Criticality for the Gehring link problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-85428

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.