Related papers: Random Colorings in Manifolds

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back more than two hundred years to the work of Euler on Latin squares and has been the focus of extensive…

This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the study of certain symmetric…

We study some sub-Riemannian objects (such as horizontal connectivity, horizontal connection, horizontal tangent plane, horizontal mean curvature) in hypersurfaces of sub-Riemannian manifolds. We prove that if a connected hypersurface in a…

We obtain a sub-Riemannian version of the classical Gauss-Bonnet theorem. We consider subsurfaces of a three dimensional contact sub-Riemannian manifolds, and using a family of taming Riemannian metric, we obtain a pure sub-Riemannian…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.

Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following…

We study a one-parameter family of time-reversible Hamiltonian vector fields in $\mathbb{R}^4$, which has received great attention in the literature. On the one hand, it is due to the role it plays in the context of certain applications in…

Accurately drawing 3D objects is difficult for untrained individuals, as it requires an understanding of perspective and its effects on geometry and proportions. Step-by-step tutorials break the complex task of sketching an entire object…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…

Let $G=G(n,m)$ be a random graph whose average degree $d=2m/n$ is below the $k$-colorability threshold. If we sample a $k$-coloring $\sigma$ of $G$ uniformly at random, what can we say about the correlations between the colors assigned to…

We give three algorithms to determine the crosscap number of a knot in the 3-sphere using $0$-efficient triangulations and normal surface theory. Our algorithms are shown to be correct for a larger class of complements of knots in closed…

When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and…

This paper studies properly embedded surfaces in the 4-ball that are exotically knotted (i.e., topologically but not smoothly isotopic), and leverages this local phenomenon to study surfaces in larger 4-manifolds. The main results provide a…

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

We explore to what extent one may hope to preserve geometric properties of three dimensional manifolds with lower scalar curvature bounds under Gromov-Hausdorff and Intrinsic Flat limits. We introduce a new construction, called sewing, of…

While successful for various computer vision tasks, deep neural networks have shown to be vulnerable to texture style shifts and small perturbations to which humans are robust. In this work, we show that the robustness of neural networks…

Much recent progress in hypergraph Ramsey theory has focused on constructions that lead to lower bounds for the corresponding Ramsey numbers. In this paper, we consider applications of these results to Gallai colorings. That is, we focus on…

A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le…

We extend to the context of hyperbolic 3-manifolds with geodesic boundary Thurston's approach to hyperbolization by means of geometric triangulations. In particular, we introduce moduli for (partially) truncated hyperbolic tetrahedra, and…