Related papers: Random Colorings in Manifolds
We develop a holonomy reduction procedure for general Cartan geometries. We show that, given a reduction of holonomy, the underlying manifold naturally decomposes into a disjoint union of initial submanifolds. Each such submanifold…
We construct invariants for any closed semipositive symplectic manifold which count rational curves satisfying tangency constraints to a local divisor. More generally, we introduce invariants involving multibranched local tangency…
Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More…
Higher dimensional graphs can be used to colour two-dimensional geometric graphs. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colourable with 4 colours. The later goal is achieved if…
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…
We propose Riemannian Denoising Diffusion Probabilistic Models (RDDPMs) for learning distributions on submanifolds of Euclidean space that are level sets of functions, including most of the manifolds relevant to applications. Existing…
We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.
Classical topological concepts are applied to understand high performance computing simulations of molecules writhing in three dimensional space. These simulations produce peta-bytes of floating point data, to describe 3 dimensional changes…
Deep Neural Networks are widely used for solving complex problems in several scientific areas, such as speech recognition, machine translation, image analysis. The strategies employed to investigate their theoretical properties mainly rely…
We prove that a uniformly chosen proper $3$-coloring of the $d$-dimensional discrete torus has a very rigid structure when the dimension $d$ is sufficiently high. We show that with high probability the coloring takes just one color on…
The aim of this paper is twofold. On the one hand, it provides a review of the links between random tensor models, seen as quantum gravity theories, and the PL-manifolds representation by means of edge-colored graphs (crystallization…
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…
The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…
A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivariate normal distribution.
Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to…
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance…
Cohomology fractals are images naturally associated to cohomology classes in hyperbolic three-manifolds. We generate these images for cusped, incomplete, and closed hyperbolic three-manifolds in real-time by ray-tracing to a fixed visual…
Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we…
Let $G=(V,E)$ be a multigraph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\frac{3}{2}\Delta$ colors by Shannon's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\Delta$…