Open Access

Local properties of simplicial complexes

Fixed Point Theory and Applications20122012:11

https://doi.org/10.1186/1687-1812-2012-11

Received: 10 June 2011

Accepted: 8 February 2012

Published: 8 February 2012

Abstract

Retractable, collapsable, and recursively contractible complexes are examined in this article. Two leader election algorithms are presented. The Nowakowski and Rival theorem on the fixed edge property in an infinite tree for simplicial maps is extended to a class of infinite complexes.

Keywords

collapsable ≤n-complexperfect elimination schemeretractable ≤n-complex

1 Introduction

By N we denote the set of natural numbers. Let V be a nonempty set and I n = {0, . . . , n} (n N ). (V) is the family of all nonempty subsets of V and n (V) (resp., n(V)) is the family of all subsets of V of cardinality n+1 (resp., at most n + 1), n N. An element of P n (V ) is called an n-simplex (or an n-dimensional simplex) defined on the set V and a nonempty family K n n ( V ) of n-simplices defined on V is called an n-complex defined on the set V (or an n-dimensional complex).

A complex generated by an n-simplex S is the complex K n ( S ) = { V : V S , V } . We denote S ¯ : = K n ( S ) .

Generally, a complex K n (or an ≤n-complex K ) defined on the set V is the union of some complexes generated by i-simplices, i I n , i.e., K n n ( V ) , and for any simplex S K n , K n ( S ) K n . A 0-simplex is called a vertex. We denote by V ( K ) the set of all vertices of K .

Two vertices of a complex are adjacent, if they both belong to a simplex belonging to this complex.

Simplices of a complex are adjacent, if they have a common vertex.

A star at a vertex p (in an ≤n-complex K ) is the ≤n-complex s t K ( p ) = { S ̄ : p S K } ; the vertex p is also called a center of a star.

Let S K n be an i-simplex of a complex K n . Then the i-simplex S is a single i-simplex (of K n ) if there exists exactly one (i + 1)-simplex T K n such that S T (i In-1); compare Definition 2.60 [1] of a free face.

A complex L m K n ( m n ) is obtained by an elementary collapse of a ≤n-complex K n if there is a single i-simplex S T K n and L m = K n \ { S , T } , where T is the unique (i + 1)-simplex containing S (i < n); see [2] and compare the definition of d-collapsing in [3].

The definition above is more precise than the definition of an elementary collapse of a complex [4]. It is similar to an elementary collapse of a cube (see Definition 2.64 in [1]).

We say that an ≤n-complex is K n collapsable to an ≤m-complex K m ( K m K n , m n ) if and only if there are subcomplexes L k + 1 , L k , , L 0 , such that L i is obtained by an elementary collapse of L i + 1 ( i I k ) , L k + 1 = K n and L 0 = K m , for some k N.

An ≤n-complex K n is collapsable, if it is collapsable to one vertex.

For a simplex S = { p 0 , , p n } K n we denote its boundary by S : = { { p 0 , , p ^ i , , p n } : i I n } K n , where p ^ i means that the vertex p i is omitted.

Notice that for an (n + 1)-simplex S, ∂S is an n-complex consisting of all n-subsimplices of S.

Let u, v be adjacent vertices of a complex K n and let V be the set of its vertices. We call a map r : VV\{u} defined by r(u) = v and r(x) = x for x V\{u}, a retraction if:

(i) u and v do not belong to the boundary S K n of some simplex S K n ,

(ii) the complex K n defined on vertices V\{u} with simplices S K n , such that u S or S = S'\{u} {v} for some S K n and S' u, is a subcomplex of K n .

A complex K n which can be obtained from a complex K n by a finite sequence of retractions is called a retract of the complex K n .

A complex K n is retractable if it can be reduced, by a sequence of retractions, to one vertex.

A union of complexes K i ( i I n ) is the complex L = i I n K i with vertices V ( L ) = i I n V ( K i ) .

Analogously, an intersection of complexes K i ( i I n ) is the complex L = i I n K i with vertices V ( L ) = i I n V ( K i ) .

A graph G is a nonempty set V (G), whose elements are called vertices, and a set E ( G ) 1 ( V ( G ) ) of elements of unordered pairs of the set V (G) called edges. In case an unordered pair consists of a vertex, it is called a loop.

For convenience we identify the graph with the respective complex K 1 .

2 Retractable complexes

Observe that an ≤n-complex K is precisely defined by its vertices V ( K ) : = S K S and its maximal simplices max K : = { S : S K ; there is no T such that S T K and ST}.

For complexes K n and L m a map f : V ( K n ) V ( L m ) is called simplicial if every simplex of K n is mapped onto some simplex of L m .

We say that a complex K , with the vertices V ( K ) = S K S has the fixed simplex property if for every simplicial map f : V ( K ) V ( K ) there exists a simplex S K which is mapped onto itself, i.e., f(S) = S.

For retractable ≤n-complexes the fixed simplex property is valid:

Theorem 2.1 ([5], Theorem 2.3). If an ≤n-complex is retractable, then it has the fixed simplex property.

The above result implies the Hell and Nešetřil theorem: any endomorphism of a dismantlable graph fixes some clique [6].

Notice that retractable ≤n-complexes may have only one vertex which begins a sequence of retraction (see Figure 1).
Figure 1

A retractable complex K 2 = { { 123 } , {124}, {135}, {23 v }, {24 v }, {35 v }, {4 uv }, {5 uv }, {12}, . . . } with only vertex u beginning retractions.

In the example of Figure 1, the only possible retraction maps u to the vertex v. Thus, we can not obtain any vertex as a retract (the vertex u is not possible to obtain in this case).

Fact 2.2. For the retraction of a vertex u to a vertex v the vertices adjacent to the vertex u are also adjacent to the vertex v. Thus a retraction is a simplicial map.

For a retractable complex we can define a local algorithm to obtain a vertex of this complex.

Algorithm 2.3 [reducing a retractable complex to a vertex]:

Input: any retractable complex K n .

Step of Algorithm: find a vertex u for a possible retraction and remove u with all simplices containing it.

The algorithm terminates if there are no possible retractions.

As a result of such algorithm we obtain some vertex.

This is the leader election Algorithm L [7, 8].

Algorithm 2.4 [obtaining a retractable complex]:

Input: a vertex u.

Step of Algorithm: add vertex v adjacent to some vertex u and all its neighbors to generate simplices containing {u, v} of desired dimension.

The algorithm terminates after generating desired number of vertices.

As a result we obtain any retractable complex.

Similar algorithms were obtained in [9].

A complex K is an extensor of a subcomplex K , if a subcomplex K is a retract of K .

Fact 2.5. If a complex K is an extensor of the retractable complex K , then it is retractable.

From Theorem 2.1 we have:

Corollary 2.6. If a complex K is an extensor of the retractable complex K , then it has the fixed point property.

3 Collapsable complexes

The class of collapsable complexes is bigger than the class of retractable complexes.

Theorem 3.1. Every retractable complex is collapsable.

Proof. We show a construction of an elementary collapse. Let K n be a retractable complex. There are two vertices u, v and a retraction taking u to v and a subcomplex K n being a retract of K n . Let us consider the set of all neighbors of u. From our assumption all those vertices are adjacent to v. Consider the star in K n with the center u. Let T be a maximal simplex of this star. There is also a simplex S s t K ( u ) which is a maximal proper subsimplex of T (not containing v) and thus S is a single simplex. We can define a sequence of elementary collapses of K n to obtain a complex K n .   □

However, the converse of Theorem 3.1. is not true (see Figure 2).
Figure 2

Collapsable complex K 2 (contains all possible 2-simplices on the picture) which is not retractable.

In the complex K 2 shown in the Figure 2, there are no possible retractions. Let us consider any pair {u, v} of adjacent vertices of K 2 . Notice that for any choice of {u, v} there exists a vertex x such that x, u are adjacent and x, v are not adjacent. If r(u) = v, there appears a new 1-simplex {x, v}. Thus obtained complex is not a subcomplex of K 2 and the map r is not well defined retraction.

In fact, the proof of Theorem 3.1 defines the leader election algorithm [7] for collapsable complexes:

Algorithm 3.2 [reducing a collapsable complex to a ≤1-complex]:

Input: a collapsable complex K n .

Step of Algorithm: find a single simplex S T (where T is the unique simplex in K n ) of the highest possible dimension (greater than 0), remove S and T.

The algorithm terminates if every single simplex is 0-simplex (a vertex).

As a result we obtain a spanning tree of K n .

Algorithm 3.3 [reducing a retractable ≤1-complex (a tree) to its vertex]:

Input: a retractable ≤1-complex L n , a vertex x of L n .

Step of Algorithm: find a single 0-simplex yx, remove it and the 1-complex containing it.

The algorithm terminates if there are no vertices but x.

As a result, we may obtain any arbitrarily chosen vertex of L n .

4 Complexes without infinite paths

In this paragraph, we generalize the theorem of Rival and Nowakowski:

Theorem 4.1 ([10], Theorem 3). Let G be a graph with loops. Every edge-preserving map of set of V (G) to itself fixes an edge if and only if (i) G is connected, (ii) G contains no cycles, and (iii) G contains no infinite paths.

We prove the fixed simplex property for the complexes which are not necessarily finite.

By an ∞-complex K defined on a set V we understand a family consisting of some n-simplices of ( V ) with the property that for any n-simplex S K , S ¯ K ; (n N).

An infinite path in a complex K is a sequence of vertices {s0, s1, . . . } of K such that {s i , si+1} is 1-simplex of K ( i N ) .

In case s k = sk+ifor some k N and every i N we define a finite path of the length k and we denote it by P = {s0, s1, . . . , s k }. The length k of P we denote by l(P).

Remark 4.2. An ≤1-complex consisting of vertices of some finite path {s0, . . . , s k } and 1-complexes {s i , si+1} (i {0, 1, . . . , k - 1}) in case s i s j for ij (i, j I k ) is a retractable complex. So, it has the fixed simplex property.

A cycle is a finite path {s0, s1, . . . , s k } (k N ) such that { s 0 , s k } K .

A complex K is connected if every pair of vertices belongs to a finite path in K .

Theorem 4.3. A connected complex K without infinite paths and with the property that every complex induced by a cycle is a retractable complex has the fixed simplex property.

Proof. Assume K is a complex containing no infinite paths. Suppose f : V ( K ) V ( K ) is a simplicial map with no fixed simplex. Let us choose a vertex s0 in K such that a path P = {s0, . . . , f(s0)} has minimal length. Of course P contains at least two distinct vertices. Define f i (P) := {f i (s0), . . . , fi+1(s0)} (i ≥ 0, f0(P) := P). Because the length of P is minimal, then l(f i (P)) = l(fi+1(P)), i ≥ 0. Without loss of generality, we may assume that f i (P) ∩ fi+k(P) = for k > 1, i N. Otherwise K would contain a cycle and because it generates a retractable complex, so it would have the fixed simplex property by Theorem 2.1. Observe also that f i (P) ∩ fi+1(P) = {fi+1(s0)} for i ≥ 0. Otherwise f i (P) = fi+1(P) for some i ≥ 0 and by Remark 4.2 there is a fixed simplex for f. Therefore, the complex K contains the infinite path {P, f(P), f 2(P), . . . } and this contradicts our assumption.   □

5 Recursively contractible complexes

A complex is recursively contractible if it is generated by an n-simplex (a simple complex [11]) or it is the union of two recursively contractible complexes such that their intersection is also a recursively contractible complex.

A complex is s-recursively contractible (tree like) if it is generated by an n-simplex or it is the union of two s-recursively contractible complexes such that their intersection is a complex generated by a simplex.

We showed that the s-recursively contractible complexes are a proper subclass of the retractable complexes:

Theorem 5.1. [5] For an s-recursively contractible complex K n we can obtain the complex generated by any simplex of K n by a sequence of retractions.

Corollary 5.2. [5] Every s-recursively contractible complex is retractable.

The converse of Corollary 5.2. is obviously not true (see Figure 3). Now, we show that the class of collapsable complexes is strictly contained in the class of *-recursively contractible complexes.
Figure 3

A retractable complex K 2 (containing three 2-simplices: {123}, {134}, {234}) which is not s -recursively contractible.

A complex is *-recursively contractible if it is generated by an n-simplex or it is the union of two *-recursively contractible complexes such that their intersection is a star.

Theorem 5.3. If an ≤n-complex K is collapsable, then it is *-recursively contractible.

Proof. Observe that a star of a vertex of a complex K is a collapsable complex and it is also recursively contractible.

If a complex K n is collapsable, then there exists a sequence of complexes (and elementary collapses) L k + 1 , L k , , L 0 ; K n = L k + 1 and L 0 is a 0-simplex (k N). For any complex L m + 1 ( m I k ) there is a single i-simplex S in L m + 1 and a unique (i + 1)-simplex T such that S T, for some i In-1. Thus L m + 1 is the union of complexes L m and K i + 1 ( T ) and their intersection is a complex K i + 1 ( T ) \ { S , T } which is a star of a vertex. The complexes K i + 1 ( T ) and K i + 1 ( T ) \ { S , T } are *-recursively contractible (i N). The complex L m can be represented as a union of a *-recursively contractible complex and the complex L m - 1 and their intersection is a *-recursively contractible complex. Because the sequence of elementary collapses in complexes L m + 1 , m I k is finite and L 0 is *-recursively contractible as a 0-simplex, then the complex K n is *-recursively contractible.   □

There are some *-recursively complexes which are not collapsable (see Figure 4).
Figure 4

A construction of *-recursively contractible complex which is not collapsable.

The ≤2-complex in the Figure 4 contains eight 2-simplices: {126}, {146}, {256}, {456}, {145}, {134}, {135}, {235}. The only single 1-simplices are: {12}, {23}, {34}. We need four copies of this complex taken in pairs for each we glue the thick 1-simplices {23}, {34} to obtain two collapsable complexes. Each of them has two single 1-simplices {12} and its copy) with common vertex: a star. We glue them again along these stars. The intersection is a star and the complex obtained is *-recursively contractible but not collapsable.

We know that a collapsable complex can be collapsed to any vertex. We may proceed collapsing beginning with maximal single i-simplices to obtain a tree. Thus it is collapsable to any chosen vertex. Collapsable complexes cannot be reduced by a sequence of elementary collapses to an arbitrarily chosen subcomplex. We construct a collapsable complex with only one single 1-simplex (see Figure 5).
Figure 5

Collapsable complex with the only one single 1-simplex.

We construct a complex as the union of two copies of the ≤2-complex presented on the Figure 5. In this case the copies differ by one vertex (the first copy has six vertices, the other has seven vertices: we add the vertex I here and, respectively, triangulate the simplex {126} onto {I 16} and {I 26}, adding the 1-simplex {I 6}). We identify respective pairs of vertices 2, 3, 4, and the vertex 1 from first copy with the vertex I from the other copy. The obtained complex is still collapsable but has only one single 1-simplex {1I}.

Any *-recursively contractible complex is obviously recursively contractible but these classes are not equivalent (see Figure 6).
Figure 6

Recursively contractible complex which is not *-recursively contractible.

Consider the complex as a union of the following complexes. The first one consists of five vertices and edges as shown in the Figure 6 and the faces {124}, {134}, {135}, {145}, {235}, {245}. The second one is a copy of the first one but with three more vertices (A, B, C), 1-simplices {A 2}, {AB}, {B 5}, {C 5}, {AC}, {A 3}, {A 5} and appropriate 2-simplices. Both complexes are collapsible, their intersection is a ≤2-complex {{1}, {2}, {3}, {4}, {12}, {23}, {34}} which is obviously collapsible, but the union does not have any single i-simplex (see Figure 4). Moreover, the obtained complex is not *-recursively contractible which can be verified by analyzing all its stars (removing any star of this complex does not disconnect it).

A graph G which generates a retractable complex K G is called a retractable graph.

A graph G is triangulated if every cycle of length greater than 3 possesses a chord, i.e., an edge joining two nonconsecutive vertices of the cycle.

A clique in a graph G is a subgraph H of G with V (H) V (G), E ( H ) E ( G ) such that E ( H ) = 1 ( V ( H ) ) .

A vertex x is called perfect if the set of its neighbors induces a clique.

Every triangulated graph G has a perfect elimination scheme (p. e. s.), i.e., we can always find a perfect vertex v in G and eliminate it with all edges e of G such that v e (e.g., [[7], Theorem 1.1]).

A subset S V (G) is a vertex separator for nonadjacent vertices a, b if the removal of S from the graph G separates a and b into distinct connected subgraphs of G.

S V (G) is a minimal vertex separator for nonadjacent vertices a and b, if it is a vertex separator not properly containing any other vertex separator for a, b.

Observe that every (induced) subgraph of a triangulated graph is triangulated. Consider a complex generated by any triangulated graph (by covering by maximal cliques). It is an s-recursively contractible complex by

Fact 5.4. [12] A graph G is triangulated if and only if every minimal vertex separator induces a clique in G.

Let the vertices of a graph G be covered by its maximal cliques (the covering is unique). These cliques generate maximal simplices. The graph G is identified with a graph complex K G consisting of these simplices and its subsimplices. There is one to one correspondence between the graph G and the graph complex K G defined in that way.

Fact 5.5. Every triangulated graph generates an s-recursively contractible complex.

Any s-recursively contractible complex can be reduced, by a sequence of retractions, to an arbitrarily chosen subcomplex generated by some simplex. However for collapsable complexes, as well as for *-recursively contractible complexes, such reduction is not always possible (see Figure 2).

Declarations

Authors’ Affiliations

(1)
Institute of Mathematics, Jan Kochanowski University
(2)
Institute of Computer Science, Polish Academy of Sciences
(3)
Faculty of Mathematics and Information Science, Warsaw University of Technology

References

  1. Kaczynski T, Mischaikow K, Mrozek M: Computational Homology. Springer-Verlag, New York, Inc; 2004.View ArticleGoogle Scholar
  2. Whitehead JHC: Simplicial spaces, nuclei and m -groups. Proc Lond Math Soc 1939, 45: 243–327. 10.1112/plms/s2-45.1.243View ArticleGoogle Scholar
  3. Wegner G: d-Collapsing and Nerves of Families of Convex Sets. Archiv der Math-ematik 1975, 26: 317–321. 10.1007/BF01229745MathSciNetView ArticleGoogle Scholar
  4. Dey TK, Edelsbrunner H, Guha S: Computational Topology. Contemp Math 1999, 223: 109–143.MathSciNetView ArticleGoogle Scholar
  5. Idzik A, Zapart A: Fixed Simplex Property for Retractable Complexes. Fixed Point Theory Appl 2010, 2010: 7. Article ID 303640, doi:10.1155/2010/303640MathSciNetView ArticleGoogle Scholar
  6. Hell P, Nešetřil J: Graphs and Homomorphisms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press Inc, New York; 2004.View ArticleGoogle Scholar
  7. Mazurkiewicz A: Local properties of triangular graphs. Fundamenta Informaticae 2007, 79: 487–495.MathSciNetGoogle Scholar
  8. Mazurkiewicz A: Local computations on triangular graphs. Fundamenta Infor-maticae 2010, 100: 117–140.MathSciNetGoogle Scholar
  9. Mazurkiewicz A: Locally derivable graphs. Fundamenta Informaticae 2007, 75: 335–355.MathSciNetGoogle Scholar
  10. Nowakowski R, Rival I: Fixed-edge theorem for graphs with loops. J Graph Theory 1979, 3: 339–350. 10.1002/jgt.3190030404MathSciNetView ArticleGoogle Scholar
  11. Wieczorek A: The Kakutani property and the fixed point property of topological spaces with abstract convexivity. J Math Anal Appl 1992, 168: 483–499. 10.1016/0022-247X(92)90174-CMathSciNetView ArticleGoogle Scholar
  12. Golumbic MC: Algorithmic Graph Theory and Perfect Graphs. In Annals of Discrete Mathematics. Volume 57. 2nd edition. Elsevier; 2004.Google Scholar

Copyright

© Idzik and Zapart; licensee Springer. 2012

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.