arXiv subjects

Jason Cantarella

Publications and source records attributed to Jason Cantarella.

At least 37 records · Page 2Linked to original sources

arXiv2017

Random Triangles and Polygons in the Plane

We consider the problem of finding the probability that a random triangle is obtuse, which was first raised by Lewis Caroll. Our investigation leads us to a natural correspondence between plane polygons and the Grassmann manifold of 2-planes in real $n$-space proposed by Allen Knutson and Jean-Claude Hausmann. This correspondence defines a natural probability measure on plane polygons. In these terms, we answer Caroll's question. We then explore the Grassmannian geometry of planar quadrilaterals, providing an answer to Sylvester's four-point problem, and describing explicitly the moduli space of unordered quadrilaterals. All of this provides a concrete introduction to a family of metrics used in shape classification and computer vision.

math.MG↗

arXiv2016

A Fast Direct Sampling Algorithm for Equilateral Closed Polygons

Sampling equilateral closed polygons is of interest in the statistical study of ring polymers. Over the past 30 years, previous authors have proposed a variety of simple Markov chain algorithms (but have not been able to show that they converge to the correct probability distribution) and complicated direct samplers (which require extended-precision arithmetic to evaluate numerically unstable polynomials). We present a simple direct sampler which is fast and numerically stable, and analyze its runtime using a new formula for the volume of equilateral polygon space as a Dirichlet-type integral.

cond-mat.stat-mech↗

arXiv2016

The symplectic geometry of closed equilateral random walks in 3-space

A closed equilateral random walk in 3-space is a selection of unit length vectors giving the steps of the walk conditioned on the assumption that the sum of the vectors is zero. The sample space of such walks with $n$ edges is the $(2n-3)$-dimensional Riemannian manifold of equilateral closed polygons in $\mathbb{R}^3$. We study closed random walks using the symplectic geometry of the $(2n-6)$-dimensional quotient of the manifold of polygons by the action of the rotation group $\operatorname {SO}(3)$. The basic objects of study are the moment maps on equilateral random polygon space given by the lengths of any $(n-3)$-tuple of nonintersecting diagonals. The Atiyah-Guillemin-Sternberg theorem shows that the image of such a moment map is a convex polytope in $(n-3)$-dimensional space, while the Duistermaat-Heckman theorem shows that the pushforward measure on this polytope is Lebesgue measure on $\mathbb{R}^{n-3}$. Together, these theorems allow us to define a measure-preserving set of "action-angle" coordinates on the space of closed equilateral polygons. The new coordinate system allows us to make explicit computations of exact expectations for total curvature and for some chord lengths of closed (and confined) equilateral random walks, to give statistical criteria for sampling algorithms on the space of polygons and to prove that the probability that a randomly chosen equilateral hexagon is unknotted is at least $\frac{1}{2}$. We then use our methods to construct a new Markov chain sampling algorithm for equilateral closed polygons, with a simple modification to sample (rooted) confined equilateral closed polygons. We prove rigorously that our algorithm converges geometrically to the standard measure on the space of closed random walks, give a theory of error estimators for Markov chain Monte Carlo integration using our method and analyze the performance of our method. Our methods also apply to open random walks in certain types of confinement, and in general to walks with arbitrary (fixed) edgelengths as well as equilateral walks.

math.DG↗

arXiv2015

Knot Probabilities in Random Diagrams

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 10 and fewer crossings are unknots (about 78% of the roughly 1.6 billion 10 crossing diagrams). For these crossing numbers, the unknot fraction is mostly explained by the prevalence of tree-like diagrams which are unknots for any assignment of over/under information at crossings. The data shows a roughly linear relationship between the log of knot type probability and the log of the frequency rank of the knot type, analogous to Zipf's law for word frequency. All knot frequencies are available as ancillary data.

math.GT↗

arXiv2015

Rigid Origami Vertices: Conditions and Forcing Sets

We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the unassigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, which are the smallest collection of creases that, when folded, will force all the other creases to fold in a prescribed way.

math.MG↗

arXiv2013

Ropelength Criticality

The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring complexity. In terms of the core curve, the thickness constraint has two parts: an upper bound on curvature and a self-contact condition. We give a set of necessary and sufficient conditions for criticality with respect to this constraint, based on a version of the Kuhn-Tucker theorem that we established in previous work. The key technical difficulty is to compute the derivative of thickness under a smooth perturbation. This is accomplished by writing thickness as the minimum of a $C^1$-compact family of smooth functions in order to apply a theorem of Clarke. We give a number of applications, including a classification of the "supercoiled helices" formed by critical curves with no self-contacts (constrained by curvature alone) and an explicit but surprisingly complicated description of the "clasp" junctions formed when one rope is pulled tight over another.

math.DG↗

arXiv2012

Symmetric Criticality for Tight Knots

We prove a version of symmetric criticality for ropelength-critical knots. Our theorem implies that a knot or link with a symmetric representative has a ropelength-critical configuration with the same symmetry. We use this to construct new examples of ropelength critical configurations for knots and links which are different from the ropelength minima for these knot and link types.

math.DG↗

arXiv2012

The tight knot spectrum in QCD

We model the observed $J^{++}$ mesonic mass spectrum in terms of energies for tightly knotted and linked chromoelectric QCD flux tubes. The data is fit with one and two parameter models. We predict a possible new state at approximately 1190 MeV and a plethora of new states above 1690 MeV.

hep-ph↗

arXiv2012

A new cohomological formula for helicity in $\R^{2k+1}$ reveals the effect of a diffeomorphism on helicity

The helicity of a vector field is a measure of the average linking of pairs of integral curves of the field. Computed by a six-dimensional integral, it is widely useful in the physics of fluids. For a divergence-free field tangent to the boundary of a domain in 3-space, helicity is known to be invariant under volume-preserving diffeomorphisms of the domain that are homotopic to the identity. We give a new construction of helicity for closed $(k+1)$-forms on a domain in $(2k+1)$-space that vanish when pulled back to the boundary of the domain. Our construction expresses helicity in terms of a cohomology class represented by the form when pulled back to the compactified configuration space of pairs of points in the domain. We show that our definition is equivalent to the standard one. We use our construction to give a new formula for computing helicity by a four-dimensional integral. We provide a Biot-Savart operator that computes a primitive for such forms; utilizing it, we obtain another formula for helicity. As a main result, we find a general formula for how much the value of helicity changes when the form is pushed forward by a diffeomorphism of the domain; it relies upon understanding the effect of the diffeomorphism on the homology of the domain and the de Rham cohomology class represented by the form. Our formula allows us to classify the helicity-preserving diffeomorphisms on a given domain, finding new helicity-preserving diffeomorphisms on the two-holed solid torus, and proving that there are no new helicity-preserving diffeomorphisms on the standard solid torus. We conclude by defining helicities for forms on submanifolds of Euclidean space. In addition, we provide a detailed exposition of some standard `folk' theorems about the cohomology of the boundary of domains in $\R^{2k+1}$.

math.GT↗

arXiv2012

The Expected Total Curvature of Random Polygons

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed polygon and a random open polygon with the same number of turning angles approaches a positive constant. We show that this is true for a natural class of probability measures on polygons, and give a formula for the constant in terms of the moments of the edgelength distribution. We then consider the symmetric measure on closed polygons of fixed total length constructed by Cantarella, Deguchi, and Shonkwiler. For this measure, we are able to prove that the expected value of total curvature for a closed n-gon is exactly π/2 n + (π/4) 2n/(2n-3). As a consequence, we show that at least 1/3 of fixed-length hexagons and 1/11 of fixed-length heptagons in 3-space are unknotted.

math.DG↗

arXiv2012

Probability Theory of Random Polygons from the Quaternionic Viewpoint

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of closed n-gons in 3-space of total length 2. Our probability measure on polygon space is defined by pushing forward Haar measure on the Stiefel manifold by this map. A similar construction yields a probability measure on plane polygons which comes from a real Stiefel manifold. The edgelengths of polygons sampled according to our measures obey beta distributions. This makes our polygon measures different from those usually studied, which have Gaussian or fixed edgelengths. One advantage of our measures is that we can explicitly compute expectations and moments for chordlengths and radii of gyration. Another is that direct sampling according to our measures is fast (linear in the number of edges) and easy to code. Some of our methods will be of independent interest in studying other probability measures on polygon spaces. We define an edge set ensemble (ESE) to be the set of polygons created by rearranging a given set of n edges. A key theorem gives a formula for the average over an ESE of the squared lengths of chords skipping k vertices in terms of k, n, and the edgelengths of the ensemble. This allows one to easily compute expected values of squared chordlengths and radii of gyration for any probability measure on polygon space invariant under rearrangements of edges.

math.DG↗

arXiv2012

The 27 possible intrinsic symmetry groups of two-component links

We consider the "intrinsic" symmetry group of a two-component link $L$, defined to be the image $Σ(L)$ of the natural homomorphism from the standard symmetry group $\MCG(S^3,L)$ to the product $\MCG(S^3) \cross \MCG(L)$. This group, first defined by Whitten in 1969, records directly whether $L$ is isotopic to a link $L'$ obtained from $L$ by permuting components or reversing orientations; it is a subgroup of $Γ_2$, the group of all such operations. For two-component links, we catalog the 27 possible intrinsic symmetry groups, which represent the subgroups of $Γ_2$ up to conjugacy. We are able to provide prime, nonsplit examples for 21 of these groups; some are classically known, some are new. We catalog the frequency at which each group appears among all 77,036 of the hyperbolic two-component links of 14 or fewer crossings in Thistlethwaite's table. We also provide some new information about symmetry groups of the 293 non-hyperbolic two-component links of 14 or fewer crossings in the table.

math.GT↗

arXiv2011

The Shapes of Tight Composite Knots

We present new computations of tight shapes obtained using the constrained gradient descent code RIDGERUNNER for 544 composite knots with 12 and fewer crossings, expanding our dataset to 943 knots and links. We use the new data set to analyze two outstanding conjectures about tight knots, namely that the ropelengths of composite knots are at least 4π-4 less than the sums of the prime factors and that the writhes of composite knots are the sums of the writhes of the prime factors.

math.DG↗

arXiv2011

Intrinsic symmetry groups of links with 8 and fewer crossings

We present an elementary derivation of the "intrinsic" symmetry groups for knots and links of 8 or fewer crossings. The standard symmetry group for a link is the mapping class group $\MCG(S^3,L)$ or $\Sym(L)$ of the pair $(S^3,L)$. Elements in this symmetry group can (and often do) fix the link and act nontrivially only on its complement. We ignore such elements and focus on the "intrinsic" symmetry group of a link, defined to be the image $Σ(L)$ of the natural homomorphism $\MCG(S^3,L) \rightarrow \MCG(S^3) \cross \MCG(L)$. This different symmetry group, first defined by Whitten in 1969, records directly whether $L$ is isotopic to a link $L'$ obtained from $L$ by permuting components or reversing orientations. For hyperbolic links both $\Sym(L)$ and $Σ(L)$ can be obtained using the output of \texttt{SnapPea}, but this proof does not give any hints about how to actually construct isotopies realizing $Σ(L)$. We show that standard invariants are enough to rule out all the isotopies outside $Σ(L)$ for all links except $7^2_6$, $8^2_{13}$ and $8^3_5$ where an additional construction is needed to use the Jones polynomial to rule out "component exchange" symmetries. On the other hand, we present explicit isotopies starting with the positions in Cerf's table of oriented links which generate $Σ(L)$ for each link in our table. Our approach gives a constructive proof of the $Σ(L)$ groups.

math.GT↗

arXiv2010

Knot Tightening By Constrained Gradient Descent

We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately minimize the ropelength (or quotient of length and thickness) for polygons in their knot types. While previous authors have minimized ropelength for polygons using simulated annealing, the new idea in our code is to minimize length over the set of polygons of thickness at least one using a version of constrained gradient descent. We rewrite the problem in terms of minimizing the length of the polygon subject to an infinite family of differentiable constraint functions. We prove that the polyhedral cone of variations of a polygon of thickness one which do not decrease thickness to first order is finitely generated, and give an explicit set of generators. Using this cone we give a first-order minimization procedure and a Karush-Kuhn-Tucker criterion for polygonal ropelength criticality. Our main numerical contribution is a set of 379 almost-critical prime knots and links, covering all prime knots with no more than 10 crossings and all prime links with no more than 9 crossings. For links, these are the first published ropelength figures, and for knots they improve on existing figures. We give new maps of the self-contacts of these knots and links, and discover some highly symmetric tight knots with particularly simple looking self-contact maps.

math.DG↗

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↗

arXiv2005

Self-contact Sets for 50 Tightly Knotted and Linked Tubes

We report on new numerical computations of the set of self-contacts in tightly knotted tubes of uniform circular cross-section. Such contact sets have been obtained before for the trefoil and figure eight knots by simulated annealing -- we use constrained gradient-descent to provide new self-contact sets for those and 48 other knot and link types. The minimum length of all unit diameter tubes in a given knot or link type is called the ropelength of that class of curves. Our computations yield improved upper bounds for the ropelength of all knots and links with 9 or fewer crossings except the trefoil.

math.DG↗

arXiv2005

A Fast Octree-Based Algorithm for Computing Ropelength

The ropelength of a space curve is usually defined as the quotient of its length by its thickness: the radius of the largest embedded tube around the knot. This idea was extended to space polygons by Eric Rawdon, who gave a definition of ropelength in terms of doubly-critical self-distances (local minima of the distance function on pairs of points on the polygon) and a function of the exterior angles of the polygon. A naive algorithm for finding the doubly-critical self-distances of an n-edge polygon involves comparing each pair of edges, and so takes O(n^2) time. In this paper, we describe an improved algorithm, based on the notion of octrees, which runs in O(n log n) time. The speed of the ropelength computation controls the performance of ropelength-minimizing programs such as Rawdon and Piatek's TOROS. An implementation of our algorithm is freely available under the GNU Public License.

math.DG↗