Polygonal complexes I: Combinatorial and geometric properties

Given a finite set of graphs \(L_1, \dots, L_n\) and an integer \(k\geq 3\), a \((k, L_1, \dots, L_n)\) complex is a 2-dimensional CW-complex satisfying -- the attaching maps are homeomorphisms, -- the intersection of two closed cells is either a closed cell or empty, -- each 2-cell is combinatorially a \(k\)-gon and -- the link of each vertex is isomorphic to one of the graphs \(L_1, \dots, L_n\). The author constructs a \((k,L_1, \dots, L_n)\) complex, \(X\), for any finite set of graphs \(L_1, \dots, L_n\). The construction uses the theory of complexes of groups [\textit{A. Haefliger}, Complexes of groups and orbihedra, in `Group theory from a geometric viewpoint' (E. Ghys, A. Haefliger and A. Verjovsky, eds.), World Scientific, Singapore, pp. 504-540 (1991; Zbl 0858.57013)]. Hence the construction also yields a contractible 2-complex, \(X^*\), with nice geometric properties and a group action with orbit space the 2-complex \(X\). The vertex groups in the complex of groups are related to the groups of automorphisms of the graphs \(L_1, \dots, L_n\) and this places some restrictions on the allowable values of \(k\). This result represents an improvement over earlier constructions by the author using mirror structures and a detailed comparison is made.

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Polygonal complexes I: Combinatorial and geometric properties

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