arXiv subjects

P. Cristofori

Publications and source records attributed to P. Cristofori.

8 recordsLinked to original sources

arXiv2023

Classifying compact 4-manifolds via generalized regular genus and G-degree

(d+1)-colored graphs, i.e. edge-colored graphs that are (d+1)-regular, have already been proved to be a useful representation tool for compact PL d-manifolds, thus extending the theory (known as crystallization theory) originally developed for the closed case. In this context, combinatorially defined PL invariants play a relevant role. The present paper focuses in particular on generalized regular genus and G-degree: the first one extending to higher dimension the classical notion of Heegaard genus for 3-manifolds, the second one arising, within theoretical physics, from the theory of random tensors as an approach to quantum gravity in dimension greater than two. We establish several general results concerning the two invariants, in relation with invariants of the boundary and with the rank of the fundamental group, as well as their behaviour with respect to connected sums. We also compute both generalized regular genus and G-degree for interesting classes of compact d-manifolds, such as handlebodies, products of closed manifolds by the interval and D^2-bundles over S^2. The main results of the paper concern dimension 4, where we obtain the classification of all compact PL manifolds with generalized regular genus at most one, and of all compact PL manifolds with G-degree at most 18; moreover, in case of empty or connected boundary, the classifications are extended to generalized regular genus two and to G-degree 24.

math.GT↗

arXiv2017

Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable manifolds (up to graph complexity 32) and for compact orientable 3-manifolds with toric boundary (up to graph complexity 12) and for infinite families of lens spaces. In this paper we extend to graph complexity 14 the computations for orientable manifolds with toric boundary and we give two-sided bounds for the graph complexity of tetrahedral manifolds. As a consequence, we compute the exact value of this invariant for an infinite family of such manifolds.

math.GT↗

arXiv2017

4-colored graphs and knot/link complements

A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an initial classification of such manifolds has been obtained up to 8 vertices of the representing graphs. Computer experiments show that the number of graphs/manifolds grows very quickly as the number of vertices increases. As a consequence, we have focused on the case of orientable 3-manifolds with toric boundary, which contains the important case of complements of knots and links in the 3-sphere. In this paper we obtain the complete catalogation/classification of these 3-manifolds up to 12 vertices of the associated graphs, showing the diagrams of the involved knots and links. For the particular case of complements of knots, the research has been extended up to 16 vertices.

math.GT↗

arXiv2015

Cataloguing PL 4-manifolds by gem-complexity

We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case n=4, succeeds to solve completely the PL-homeomorphism problem among the catalogue of all closed connected PL 4-manifolds up to gem-complexity 8 (i.e., which admit a coloured triangulation with at most 18 4-simplices). Possible interactions with the (not completely known) relationship among different classification in TOP and DIFF=PL categories are also investigated. As a first consequence of the above PL classification, the non-existence of exotic PL 4-manifolds up to gem-complexity 8 is proved. Further applications of the tool are described, related to possible PL-recognition of different triangulations of the K3-surface.

math.GT↗

arXiv2015

PL 4-manifolds admitting simple crystallizations: framed links and regular genus

Simple crystallizations are edge-coloured graphs representing PL 4-manifolds with the property that the 1-skeleton of the associated triangulation equals the 1-skeleton of a 4-simplex. In the present paper, we prove that any (simply-connected) PL $4$-manifold $M$ admitting a simple crystallization admits a special handlebody decomposition, too; equivalently, $M$ may be represented by a framed link yielding $\mathbb S^3$, with exactly $β_2(M)$ components ($β_2(M)$ being the second Betti number of $M$). As a consequence, the regular genus of $M$ is proved to be the double of $β_2(M)$. Moreover, the characterization of any such PL $4$-manifold by $k(M)= 3 β_2(M)$, where $k(M)$ is the gem-complexity of $M$ (i.e. the non-negative number $p-1$, $2p$ being the minimum order of a crystallization of $M$) implies that both PL invariants gem-complexity and regular genus turn out to be additive within the class of all PL $4$-manifolds admitting simple crystallizations (in particular: within the class of all "standard" simply-connected PL 4-manifolds).

math.GT↗

arXiv2011

Cyclic generalizations of two hyperbolic icosahedral manifolds

We discuss two families of closed orientable three-dimensional manifolds which arise as cyclic generalizations of two hyperbolic icosahedral manifolds listed by Everitt. Everitt's manifolds are cyclic coverings of the lens space $L_{3,1}$ branched over some 2-component links. We present results on covering properties, fundamental groups, and hyperbolic volumes of the manifolds belonging to these families.

math.GT↗

arXiv2006

A catalogue of orientable 3-manifolds triangulated by 30 coloured tetrahedra

The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds up to 26 coloured tetrahedra, genus two 3-manifolds up to 34 coloured tetrahedra: in fact, by automatic generation and analysis of suitable edge-coloured graphs, called crystallizations, we obtain a catalogue of all orientable 3-manifolds admitting coloured triangulations with 30 tetrahedra. These manifolds are unambiguously identified via JSJ decompositions and fibering structures. It is worth noting that, in the present work, a suitable use of elementary combinatorial moves yields an automatic partition of the elements of the generated crystallization catalogue into equivalence classes, which are proved to be in one-to one correspondence with the homeomorphism classes of the represented manifolds.

math.GT↗

arXiv2006

Computing Matveev's complexity via crystallization theory: the orientable case

By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing crystallization catalogue C^{28}, due to Lins, is used to obtain upper bounds for the complexity of closed orientable 3-manifolds triangulated by at most 28 tetrahedra. The experimental results actually coincide with the exact values of complexity, for all but three elements. Moreover, in the case of at most 26 tetrahedra, the exact value of the complexity is shown to be always directly computable via crystallization theory.

math.GT↗