Search arXivSearch

arXiv · 2207.03931

Random Colorings in Manifolds

Abstract

We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated manifold, as in recent work for curves in 3-dimensional space by Sheffield and Yadin (2014). We determine conditions on which submanifolds can arise, in terms of Stiefel-Whitney classes and other properties. We then consider the random submanifolds that arise from randomly coloring the vertices. Since this model generates submanifolds, it allows for studying properties and using tools that are not available in processes that produce general random subcomplexes. The case of 3 colors in a triangulated 3-ball gives rise to random knots and links. In this setting, we answer a question raised by de Crouy-Chanel and Simon (2019), showing that the probability of generating an unknot decays exponentially. In the general case of k colors in d-dimensional manifolds, we investigate the random submanifolds of different codimensions, as the number of vertices in the triangulation grows. We compute the expected Euler characteristic, and discuss relations to homological percolation and other topological properties. Finally, we explore a method to search for solutions to topological problems by generating random submanifolds. We describe computer experiments that search for a low-genus surface in the 4-dimensional ball whose boundary is a given knot in the 3-dimensional sphere.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaim Even-Zohar, Joel Hass. 2023-02-02. Random Colorings in Manifolds. https://doi.org/10.1007/s11856-023-2509-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT