Self-intersections in combinatorial topology: statistical structure

From MaRDI portal



Abstract: Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the minimum number of transversal self-intersection points of representatives of the class. We prove that if a class is chosen at random from among all classes of m letters, then for large m the distribution of the self-intersection number approaches the Gaussian distribution.


The authors provide statistical information on the number of self-intersections of randomly chosen oriented closed curves on a given closed orientable surface. Each such curve can be represented as a word with respect to a fixed set of generators of the fundamental group. The main result says that the distribution of the number of self-intersections of a closed oriented curve of fixed word length (uniformly chosen at random) is asymptotically Gaussian. The quite accessible proof employs U-statistics of a suitably crafted Markov chain.











This page was built for publication: Self-intersections in combinatorial topology: statistical structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421024)