Regular colored graphs of positive degree

From MaRDI portal



Abstract: Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of regular colored graphs of fixed positive degree and perform their exact and asymptotic enumeration. In particular we show that the generating function of the family of graphs of fixed degree is an algebraic series with a positive radius of convergence, independant of the degree. We describe the singular behavior of this series near its dominant singularity, and use the results to establish the double scaling limit of colored tensor models.


The authors study the enumeration of colored graphs of the following kind: given a positive integer parameter \(D\), a colored graph is a rooted connected bipartite graph (vertices colored black and white) with edges colored using colors \(\{0,1,\ldots,D\}\) in such a way that each vertex is incident to exactly one edge of each color.NEWLINENEWLINESuch colored graphs are dual to colored triangulations of piecewise linear orientable \((D+1)\)-dimensional pseudo-manifolds. One can associate an invariant, the degree (akin to the genus of a map), to every colored graph.NEWLINENEWLINEThe main enumerative result shows that the generating function that enumerates colored graphs by the number of black vertices can be expressed in terms of the function \(T(z)\) that is the unique power series solution to the equation \(T(z) = 1 + zT(z)^{D+1}\): it has the formNEWLINENEWLINENEWLINE\[NEWLINET(z) \sum_S \Big[ \frac{P_S(u)}{(1-u^2)^{U_S+B_S}(1-D^2u^2)^{B_S}} \Big]_{u=zT(z)^{D+1}},NEWLINE\]NEWLINE where the sum is over a finite set of triples consisting of a monomial \(P_S\) and integer parameters \(U_S\) and \(B_S\).NEWLINENEWLINEAs a consequence, the authors also determine the singular behavior of the generating function at the dominant singularity \(z_0 = D^D/(D+1)^{D+1}\): it is given by NEWLINE\[NEWLINEK_{\delta}(1-z/z_0)^{-B_{\mathrm{max}}/2} \Big( 1 + O \big((1-z/z_0)^{1/2}\big) \Big)NEWLINE\]NEWLINE in a slit domain around \(z_0\). Here, \(B_{\mathrm{max}}\) is the following maximum: NEWLINE\[NEWLINEB_{\mathrm{max}} = \max \big( 2c_{+} + 3q - 1 \mid (D-2)c_+ + Dq \leq \delta; \, c_+,q \in \mathbb{N} \big).NEWLINE\]NEWLINE This is used to establish the double scaling limit of colored tensor models. An interesting change of behavior between \(D \leq 5\) and \(D \geq 6\) can be observed.




Cited in
(45)








This page was built for publication: Regular colored graphs of positive degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329446)