Combinatorial properties of the G-degree

DOI10.1007/S13163-018-0279-0zbMATH Open1411.57038arXiv1707.09031OpenAlexW2741421175MaRDI QIDQ668265FDOQ668265

Authors: Maria Rita Casali, Luigi Grasselli 

Publication date: 19 March 2019

Published in: Revista Matemática Complutense (Search for Journal in Brave)

Abstract: 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 G-degree} of the involved graphs, which drives the {it $1/N$ expansion} in the tensor models context. In the present paper - by making use of combinatorial properties concerning Hamiltonian decompositions of the complete graph - we prove that, in any even dimension $dge4$, the G-degree of all bipartite graphs, as well as of all (bipartite or non-bipartite) graphs representing singular manifolds, is an integer multiple of $(d-1)!$. As a consequence, in even dimension, the terms of the $1/N$ expansion corresponding to odd powers of $1/N$ are null in the complex context, and do not involve colored graphs representing singular manifolds in the real context. In particular, in the 4-dimensional case, where the G-degree is shown to depend only on the regular genera with respect to an arbitrary pair of "associated" cyclic permutations, several results are obtained, relating the G-degree or the regular genus of 5-colored graphs and the Euler characteristic of the associated PL 4-manifolds.

Full work available at URL: https://arxiv.org/abs/1707.09031

Recommendations

• scientific article; zbMATH DE number 7203464
• A combinatorial analysis of Severi degrees
• Combinatorial properties of products of graphs
• Combinatorial properties of generalized binomial coefficients
• Some network-type properties of the space of G-permutation degree
• Combinatorial Properties of a Rooted Graph Polynomial
• Combinatorial properties of codes with degree \(n\)
• Combinatorial properties of generalized hypercube graphs
• Combinatorial properties of dependence graphs
• Degree sets and graph factorizations

zbMATH Keywords

edge-colored graphcolored tensor modelGurau degreePL-manifoldregular genussingular manifold

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Triangulating manifolds (57Q15) Unified, higher-dimensional and super field theories (83E99)

Cites Work

• Colored tensor models -- a review
• Cycle decompositions of complete multigraphs
• Invitation to random tensors
• 4-colored graphs and knot/link complements
• Compact 3-manifolds via 4-colored graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple crystallizations of 4-manifolds
• Extending the Concept of Genus to Dimension N
• An SYK-like model without disorder
• Topology in colored tensor models via crystallization theory
• G-degree for singular manifolds
• Genus-minimal crystallizations of PL 4-manifolds
• Lower bounds for regular genus and gem-complexity of PL 4-manifolds
• PL 4-manifolds admitting simple crystallizations: framed links and regular genus
• Title not available (Why is that?)
• Some bounds for the regular genus of PL-manifolds
• Large sets of Hamilton cycle and path decompositions

Cited In (6)

• Regular genus and gem-complexity of some mapping tori
• Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants
• Title not available (Why is that?)
• A combinatorial analysis of Severi degrees
• Gem-induced trisections of compact PL 4-manifolds
• Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree

This page was built for publication: Combinatorial properties of the G-degree

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