Related papers: The full Ward-Takahashi Identity for colored tenso…
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…
Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…
We treat random rank-$D$ tensor models as $D$-dimensional quantum field theories---tensor field theories (TFT)---and review some of their non-perturbative methods. We classify the correlation functions of complex tensor field theories by…
We introduce the 3-colour noncommutative quantum field theory model in two dimensions. For this model we prove a generalised Ward-Takahashi identity, which is special to coloured noncommutative QFT models and has no underlying continuous…
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 use a topological quantum field theory (TQFT) to define families of new homology theories of a $2$-dimensional CW complex of a smooth closed surface. The dimensions of these homology groups can be used to count the number…
We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting coloring} ({\it TMC-coloring}, for short) if any two vertices of…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…
We analyse the correlation functions of $\mathrm{U}(N)$-tensor models (or complex tensor models), which turn out to be classified by boundary graphs, and use the Ward-Takahashi identity and the graph calculus developed in [Commun. Math.…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
We first derive the transverse Ward-Takahashi identities (WTI) of 3-dimensional quantum electrodynamics (QED$_3$) by means of the canonical quantization method and the path integration method, and then prove for the first time that QED$_3$…
Ramsey theory enables re-shaping of the basic ideas of quantum mechanics. Quantum observables represented by linear Hermitian operators are seen as the vertices of a graph. Relations of commutation define the coloring of edges linking the…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…