Filling random cycles

  title={Filling random cycles},
  author={Fedor Manin},
  journal={Commentarii Mathematici Helvetici},
  • Fedor Manin
  • Published 25 August 2020
  • Mathematics
  • Commentarii Mathematici Helvetici
We compute the asymptotic behavior of the average-case filling volume for certain models of random Lipschitz cycles in the unit cube and sphere. For example, we estimate the minimal area of a Seifert surface for a model of random knots first studied by Millett. This is a generalization of the classical Ajtai--Komlos--Tusnady optimal matching theorem from combinatorial probability. The author hopes for applications to the topology of random links, random maps between spheres, and other models of… 

Figures from this paper

A lower bound on the average genus of a 2-bridge knot
Experimental data from Dunfield et al using random grid diagrams suggests that the genus of a knot grows linearly with respect to the crossing number. Using billiard table diagrams of Chebyshev knots


Quantitative nonorientability of embedded cycles
We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces.
Linking of uniform random polygons in confined spaces
The formula for the mean squared linking number of uniform random polygons in a confined space is derived and it is rigorously shown that the linking probability between this curve and a uniform random polygon of n vertices is at least .
Models of random knots
This work presents several known and new randomized models of knots and links, including the recently studied Petaluma model, and reports on rigorous results and numerical experiments concerning the asymptotic distribution of finite type invariants of random knots.
Polygonal knots are embeddings of polygons in three space. For each n, the collection of embedded n-gons determines a subset of Euclidean space whose structure is the subject of this paper. Which
Linking number and writhe in random linear embeddings of graphs
In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are
A simple Fourier analytic proof of the AKT optimal matching theorem
We present a short and elementary proof of the Ajtai-Komlos-Tusnady (AKT) optimal matching theorem in dimension 2 via Fourier analysis and a smoothing argument. The upper bound applies to more
The average-case analysis of some on-line algorithms for bin packing
In this paper we give tighter bounds than were previously known for the performance of the bin packing algorithms Best Fit and First Fit when the inputs are uniformly distributed on [0, 1]. We also
Rectifiable sets and the Traveling Salesman Problem
Let K c C be a bounded set. In this paper we shall give a simple necessary and sufficient condit ion for K to lie in a rectifiable curve. We say that a set is a rectifiable curve if it is the image
Moser’s theorem on manifolds with corners
Moser's theorem (1965) states that the diffeomorphism group of a compact manifold acts transitively on the space of all smooth positive densities with fixed volume. Here we describe the extension of
Geometric Measure Theory: A Beginner's Guide
Geometric Measure Theory: A Beginner's Guide, Fifth Edition provides the framework readers need to understand the structure of a crystal, a soap bubble cluster, or a universe. The book is essential