Related papers: Trisections in colored tensor models
Let be given a {\em colored 3-pseudo-triangulation} $\mathcal{H}^\star$ with $n$ tetrahedra. Colored means that each tetrahedron have vertices distinctively colored 0,1,2,3. In a {\em pseudo} 3-triangulation the intersection of simplices…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
In this note, we provide a generalization for the definition of a trisection of a 4-manifold with boundary. We demonstrate the utility of this more general definition by finding a trisection diagram for the Cacime Surface, and also by…
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…
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.
We propose a class of models which generate three-dimensional random volumes, where each configuration consists of triangles glued together along multiple hinges. The models have matrices as the dynamical variables and are characterized by…
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
Given a diagram for a trisection of a 4-manifold $X$, we describe the homology and the intersection form of $X$ in terms of the three subgroups of $H_1(\Sigma;\mathbb{Z})$ generated by the three sets of curves and the intersection pairing…
Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques (ii) by use of a discrete Hirota bilinear…
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer…
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
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.
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
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…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
Gay and Kirby recently introduced the concept of a trisection for arbitrary smooth, oriented closed 4-manifolds, and with it a new topological invariant, called the trisection genus. This paper improves and implements an algorithm due to…