Manifold crystallization
Coloured graphs (and crystallizations are a special class of them; cf. also Graph colouring) constitute a nice combinatorial approach to the topology of piecewise-linear manifolds of any dimension. It is based on the facts that an edge-coloured graph provides precise instructions to construct a polyhedron, and that any piecewise-linear manifold (cf. Topology of manifolds) arises in this way. The original concept is that of a contracted triangulation, due to M. Pezzana [a9], which is a special kind of dissection of a manifold yielding, in a natural way, a minimal atlas and a combinatorial representation of it via coloured graphs.
The graphs, considered in the theory, can have multiple edges but no loops. Given such a graph , let
and
denote the vertex set and the edge set of
, respectively. An
-coloured graph is a pair
, where
is regular of degree
and
is a mapping (the edge-colouring) from
to
(the colour set) such that incident edges have different colours. The motivation for this definition is that any
-coloured graph encodes an
-dimensional complex
constructed as follows. Take an
-simplex
for each vertex
of
, and label its vertices and its
-faces by the colours of
in such a way that vertices and opposite
-faces have the same label. Then each coloured edge of
indicates how to glue two
-simplexes along one of their common
-faces (the colour says which). More precisely, if
and
are vertices of
joined by an edge coloured
, then identify the
-faces of
and
labelled by
, so that equally labelled vertices are identified together. Clearly,
is not, in general, a simplicial complex (two simplexes may meet in more than a single subsimplex), but it is a pseudo-complex, i.e. a ball complex in which each
-ball, considered with all its faces, is abstractly isomorphic to an
-simplex.
The pair is called a crystallization of a closed connected piecewise-linear
-manifold
if the polyhedron underlying
is piecewise-linearly homeomorphic to
, and
has exactly
vertices (or, equivalently,
is a contracted triangulation of
). The existence theorem of the theory says that any closed connected piecewise-linear
-manifold
can be represented by a crystallization
in the sense made precise above [a9]. This result can be extended to piecewise-linear manifolds with non-empty boundary and to piecewise-linear generalized (homology) manifolds by suitable modifications of the definition of crystallization. So, piecewise-linear manifolds can be studied through graph theory. Unfortunately, there are many different crystallizations representing the same manifold. However, two crystallizations represent piecewise-linear homeomorphic manifolds if and only if one can be transformed into the other by a finite sequence of elementary moves (i.e. cancelling and/or adding so-called dipoles) [a7]. It follows that every topological invariant of a closed piecewise-linear manifold
can be directly deduced from a crystallization of
via a graph-theoretical algorithm.
Below, a few such invariants are indicated; see [a1], [a6], [a8] for more results and for further developments of crystallization theory.
Orientability.
A closed piecewise-linear -manifold
is orientable if and only if a crystallization of
is bipartite (cf. also Graph, bipartite), i.e. a graph whose vertex set can be partitioned into two sets in such a way that each edge joins a vertex of the first set to a vertex of the second set.
Connected sums.
Let and
be closed connected orientable piecewise-linear
-manifolds, and let
and
be crystallizations of them. A crystallization for the connected sum
can be obtained as follows. Match arbitrarily the colours of
with those of
, and take away arbitrarily a vertex for either graph. Then past together the free edges with colours corresponding in the matching. This yields the requested crystallization since, by the disc theorem, the connected sum can be performed by hollowing out the two
-simplexes represented by the deleted vertices. The two permutation classes of matching correspond to an orientation-preserving, respectively an orientation-reversing, homeomorphism of the boundaries.
Characterizations.
An immediate characterization of coloured graphs representing piecewise-linear manifolds is provided by the following criterion. An -coloured graph
encodes a closed piecewise-linear
-manifold
if and only if any connected component of the partial subgraphs obtained from
by deleting all identically coloured edges, for each colour at a time, represents the standard piecewise-linear
-sphere. See [a1], [a6], [a8] for other combinatorial characterizations of coloured graphs encoding low-dimensional manifolds.
Homotopy and homology.
A presentation of the fundamental group of a closed connected piecewise-linear -manifold
can be directly deduced from its crystallization
as follows. Choose two colours
and
in
, and denote by
…
the connected components, but one, of the
-subgraph obtained from
by deleting all edges coloured
or
(the missing component can be chosen arbitrarily). Of course, the connected components of the complementary
-subgraph are simple cycles with edges alternatively coloured
and
. If
is a surface, let
be the unique cycle as above. If the dimension of
is greater than
, denote by
these cycles, all but one arbitrarily chosen, and fix an orientation and a starting point for each of them. For each
, compose the word
on generators
by the following rules. Follow the chosen orientation starting from the chosen vertex, and write down consecutively every generator met with exponent
or
according to the colour
or
of the edge leading to the generator. A presentation of the fundamental group of
has now generators
, and relators
. A homology theory for coloured graphs was developed in [a5], where one can find the graph-theoretical analogues to exact homology sequences, cohomology groups, product, duality, etc. and the corresponding topological meanings.
Numerical invariants.
Let be a crystallization of a closed connected piecewise-linear
-manifold
. For each cyclic permutation
of
, there exists a unique
-cell imbedding (called regular; cf. also Graph imbedding) of
into a closed surface
(which is orientable or non-orientable together with
) such that its regions are bounded by simple cycles of
with edges alternatively coloured
and
(where the indices are taken modulo
). The regular genus of
is defined as the smallest integer
such that
regularly imbeds into the closed (orientable or non-orientable) surface of genus
. The regular genus of
is then the smallest of the regular genera of its crystallizations. A typical problem is to find relations between the regular genus of a manifold and the piecewise-linear structure of it. The topological classification of all closed
-manifolds up to regular genus six can be found, for example, in [a2], [a3], [a4]. In particular, if the regular genus could be proved to be additive for connected sums in dimension
, then this would imply the piecewise-linear generalized Poincaré conjecture in that dimension. Other numerical invariants of piecewise-linear manifolds arising from crystallizations, as for example many types of complexities, can be found in [a1], [a5].
Geometric structure.
An -coloured graph
is regular if its automorphism group
acts transitively on
(cf. also Graph automorphism).
is locally regular if all the cycles of
, with edges alternatively coloured
and
, have the same number of vertices, for any
. If a locally regular graph
encodes a closed connected piecewise-linear
-manifold
, then there is a regular graph
such that
is isomorphic to a tessellation (cf. also Geometry of numbers; Dirichlet tesselation) by geometric
-simplexes of
, where
is either the hyperbolic
-space, the Euclidean
-space or the
-sphere, and there is a subgroup
of
acting freely on
such that
is isomorphic to
.
References
[a1] | J. Bracho, L. Montejano, "The combinatorics of coloured triangulations of manifolds" Geom. Dedicata , 22 (1987) pp. 303–328 |
[a2] | A. Cavicchioli, "A combinatorial characterization of ![]() ![]() |
[a3] | A. Cavicchioli, "On the genus of smooth ![]() |
[a4] | A. Cavicchioli, M. Meschiari, "On classification of ![]() |
[a5] | A. Cavicchioli, M. Meschiari, "A homology theory for colored graphs" Discrete Math. , 137 (1995) pp. 99–136 |
[a6] | A. Cavicchioli, D. Repovš, A.B. Skopenkov, "Open problems on graphs arising from geometric topology" Topol. Appl. , 84 (1998) pp. 207–226 |
[a7] | M. Ferri, C. Gagliardi, "Crystallization moves" Pacific J. Math. , 100 (1982) pp. 85–103 |
[a8] | M. Ferri, C. Gagliardi, L. Grasselli, "A graph-theoretical representation of PL-manifolds: A survey on crystallizations" Aequat. Math. , 31 (1986) pp. 121–141 |
[a9] | M. Pezzana, "Sulla struttura topologica delle varietà compatte" Atti Sem. Mat. Fis. Univ. Modena , 23 (1974) pp. 269–277 |
Manifold crystallization. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Manifold_crystallization&oldid=11818