Combinatorial properties of the G-degree
From MaRDI portal
Publication:668265
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 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 , 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 . As a consequence, in even dimension, the terms of the expansion corresponding to odd powers of 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.
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
Cites work
- scientific article; zbMATH DE number 3644149 (Why is no real title available?)
- scientific article; zbMATH DE number 3491890 (Why is no real title available?)
- scientific article; zbMATH DE number 1472137 (Why is no real title available?)
- 4-colored graphs and knot/link complements
- An SYK-like model without disorder
- Colored tensor models -- a review
- Compact 3-manifolds via 4-colored graphs
- Cycle decompositions of complete multigraphs
- Extending the Concept of Genus to Dimension N
- G-degree for singular manifolds
- Genus-minimal crystallizations of PL 4-manifolds
- Invitation to random tensors
- Large sets of Hamilton cycle and path decompositions
- Lower bounds for regular genus and gem-complexity of PL 4-manifolds
- PL 4-manifolds admitting simple crystallizations: framed links and regular genus
- Simple crystallizations of 4-manifolds
- Some bounds for the regular genus of PL-manifolds
- Topology in colored tensor models via crystallization theory
Cited in
(10)- A combinatorial analysis of Severi degrees
- Regular genus and gem-complexity of some mapping tori
- \((D+1)\)-colored graphs -- a review of sundry properties
- scientific article; zbMATH DE number 7203464 (Why is no real title available?)
- Gem-induced trisections of compact PL 4-manifolds
- Regular colored graphs of positive degree
- Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants
- Colored triangulations of arbitrary dimensions are stuffed Walsh maps
- Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree
- G-degree for singular manifolds
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)
