相关论文: Large $N$ Limits in Tensor Models: Towards More Un…
Colored tensor models generalize matrix models in arbitrary dimensions yielding a statistical theory of random higher dimensional topological spaces. They admit a 1/N expansion dominated by graphs of spherical topology. The simplest tensor…
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…
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…
Tensor models generalize matrix models and generate colored triangulations of pseudo-manifolds in dimensions $D\geq 3$. The free energies of some models have been recently shown to admit a double scaling limit, i.e. large tensor size $N$…
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…
Tensor models generalize random matrix models in yielding a theory of dynamical triangulations in arbitrary dimensions. Colored tensor models have been shown to admit a 1/N expansion and a continuum limit accessible analytically. In this…
We study a connection between random tensors and random matrices through $U(\tau)$ matrix models which generate fully packed, oriented loops on random surfaces. The latter are found to be in bijection with a set of regular edge-colored…
Random tensor models can be used as combinatorial devices to generate Euclidean dynamical triangulations. A physical continuum limit of dynamical triangulations requires a suitable generalization of the double-scaling limit of random…
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 give superexponential lower and upper bounds on the number of coloured $d$-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and $d\geq 3$ is fixed. In the special…
Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…
Rooted in group field theory and matrix models, random tensor models are a recent background-invariant approach to quantum gravity in arbitrary dimensions. Colored tensor models (CTM) generate random triangulated orientable…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Colored tensor models have been recently shown to admit a large N expansion, whose leading order encodes a sum over a class of colored triangulations of the D-sphere. The present paper investigates in details this leading order. We show…
The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…
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…
We define novel fully combinatorial models of higher categories. Our definitions are based on a connection of higher categories to "directed spaces". Directed spaces are locally modelled on manifold diagrams, which are stratifications of…
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…
This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…