Related papers: Random Colorings in Manifolds

Torsion polynomials connect the genus of a hyperbolic knot (a topological invariant) with the discrete faithful representation (a geometric invariant). Using a new combinatorial structure of an ideal triangulation of a 3-manifold that…

We study "tricolor percolation" on the regular tessellation of R^3 by truncated octahedra, which is the three-dimensional analog of the hexagonal tiling of the plane. We independently assign one of three colors to each cell according to a…

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…

We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at any time, any sequence of p(k) consecutive points, for some…

We conjecture the existence of four independent gradings in the colored HOMFLY homology. We describe these gradings explicitly for the rectangular colored homology of torus knots and make qualitative predictions of various interesting…

We propose an algorithm to create a 3-colorable Delaunay Triangulation. The input of the problem we are trying to solve is a set X of n twodimensional points. The output is a 3-colorable two-dimensional Delaunay triangulation T for X U Y ,…

The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…

We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…

In this paper, we study unique colourings in random graphs as a generalization of both conflict-free and injective colourings. Specifically, we impose the condition that a fraction of vertices in the neighbourhood of any vertex are assigned…

Despite high-dimensionality of images, the sets of images of 3D objects have long been hypothesized to form low-dimensional manifolds. What is the nature of such manifolds? How do they differ across objects and object classes? Answering…

Let $H_{n,(p_m)_{m=2,\ldots,M}}$ be a random non-uniform hypergraph of dimension $M$ on $2n$ vertices, where the vertices are split into two disjoint sets of size $n$, and colored by two distinct colors. Each non-monochromatic edge of size…

We study the geometric Whitney problem on how a Riemannian manifold $(M,g)$ can be constructed to approximate a metric space $(X,d_X)$. This problem is closely related to manifold reconstruction where a smooth $n$-dimensional submanifold…

This paper presents three main results on coloring discrete $d$-pseudomanifolds: $(1)$ the general chromatic bounds $d+1 \leq X(K) \leq 2d+2$ for any $d$-pseudomanifold $K$; $(2)$ an improved bound $X(K) \leq 2d+1$ for pseudomanifolds…

We compute the asymptotic expansion of the volume of small sub-Riemannian balls in a contact 3-dimensional manifold, and we express the first meaningful geometric coefficients in terms of geometric invariants of the sub-Riemannian structure

We study compact three-manifolds with boundary obtained by randomly gluing together truncated tetrahedra along their faces. We prove that, asymptotically almost surely as the number of tetrahedra tends to infinity, these manifolds are…

Manifolds occur naturally as configuration spaces of robotic systems. They provide global descriptions of local coordinate systems that are common tools in expressing positions of robots. The purpose of this survey is threefold. Firstly, we…

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were…

This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.

Deterministic fabrication of random metamaterials requires filling of a space with randomly oriented and randomly positioned chords with an on-average homogenous density and orientation, which is a nontrivial task. We describe a method to…

We consider geometric hypergraphs whose vertex set is a finite set of points (e.g., in the plane), and whose hyperedges are the intersections of this set with a family of geometric regions (e.g., axis-parallel rectangles). A typical…