On locally constructible spheres and balls

Bruno Benedetti, Günter M. Ziegler

Introduction

Ambjørn, Boulatov, Durhuus, Jonsson, and others have worked to develop a three-dimensional analogue of the simplicial quantum gravity theory, as provided for two dimensions by Regge . (See and for surveys.) The discretized version of quantum gravity considers simplicial complexes instead of smooth manifolds; the metric properties are artificially introduced by assigning length aa to any edge. (This approach is due to Weingarten and known as “theory of dynamical triangulations”.) A crucial path integral over metrics, the “partition function for gravity”, is then defined via a weighted sum over all triangulated manifolds of fixed topology. In three dimensions, the whole model is convergent only if the number of triangulated 33-spheres with NN facets grows not faster than CNC^{N}, for some constant CC. But does this hold? How many simplicial spheres are there with NN facets, for NN large?

Without the restriction to “local constructibility” this crucial question still represents a major open problem, which was put into the spotlight also by Gromov [19, pp. 156-157]. Its 2D-analogue, however, was answered long time ago by Tutte , who proved that there are asymptotically fewer than \big{(}\frac{16}{3\sqrt{3}}\big{)}^{N} combinatorial types of triangulated 22-spheres. (By Steinitz’ theorem, cf. [49, Lect. 4], this quantity equivalently counts the maximal planar maps on n≥4n\geq 4 vertices, which have N=2n−4N=2n-4 faces, and also the combinatorial types of simplicial 33-dimensional polytopes with NN facets.)

In the following, the adjective “simplicial” will often be omitted when dealing with balls, spheres, or manifolds, as all the regular cell complexes and polyhedral complexes that we consider are simplicial.

Why are 22-spheres “not so many”? Every combinatorial type of triangulation of the 22-sphere can be generated as follows (Figure 1): First for some even N≥4N\geq 4 build a tree of NN triangles (which combinatorially is the same thing as a triangulation of an (N+2N+2)-gon), and then glue edges according to a complete matching of the boundary edges. A necessary condition in order to obtain a 22-sphere is that such a matching is planar. Planar matchings and triangulations of (N+2N+2)-gons are both enumerated by a Catalan number CN+2C_{N+2}, and since the Catalan numbers satisfy a polynomial bound CN=1N+1(2NN)<4NC_{N}=\frac{1}{N+1}\binom{2N}{N}<4^{N}, we get an exponential upper bound for the number of triangulations.

Neither this simple argument nor Tutte’s precise count can be easily extended to higher dimensions. Indeed, we have to deal with three different problems when trying to extend results or methods from dimension two to dimension three:

Many combinatorial types of simplicial 33-spheres are not realizable as boundaries of convex 44-polytopes; thus, even though we observe below that there are only exponentially-many simplicial 44-polytopes with NN facets, the 33-spheres could still be more numerous.

The counts of combinatorial types according to the number nn of vertices and according to the number NN of facets are not equivalent any more. We have 3n−10≤N≤12n(n−3)3n-10\leq N\leq\frac{1}{2}n(n-3) by the lower resp. upper bound theorem for simplicial 33-spheres. We know that there are more than 2nn2^{n\sqrt{n}} 33-spheres , but less than 220nlog⁡n2^{20n\log n} types of 44-polytopes with nn vertices , yet this does not answer the question for a count in terms of the number NN of facets.

While it is still true that there are only exponentially-many “trees of NN tetrahedra”, the matchings that can be used to glue 33-spheres are not planar any more; thus, they could be more than exponentially-many. If, on the other hand, we restrict ourselves to “local gluings”, we generate only a limited family of 33-spheres, as we will show below.

In the early nineties, new finiteness theorems by Cheeger and Grove et al. yielded a new approach, namely, to count dd-manifolds of “fluctuating topology” (not necessarily spheres) but “bounded geometry” (curvature and diameter bounded from above, and volume bounded from below). This allowed Bartocci et al. to bound for any dd-manifold the number of triangulations with NN or more facets, under the assumption that no vertex had degree higher than a fixed integer. However, for this it is crucial to restrict the topological type: Already for d=2d=2, there are more than exponentially many triangulated 22-manifolds of bounded vertex degree with NN facets.

In 1995, the physicists Durhuus and Jonsson introduced the class of “locally constructible” (LC) 33-spheres. An LC 33-sphere (with NN facets) is a sphere obtainable from a tree of NN tetrahedra, by identifying pairs of adjacent triangles in the boundary. “Adjacent” means here “sharing at least one edge”, and represents a dynamic requirement. Clearly, every 33-sphere is obtainable from a tree of NN tetrahedra by matching the triangles in its boundary; according to the definition of LC, however, we are allowed to match only those triangles that are adjacent – or that have become adjacent by the time of the gluing.

Durhuus and Jonsson proved an exponential upper bound on the number of combinatorially distinct LC spheres with NN facets. Based also on computer simulations (, see also and ) they conjectured that all 33-spheres should be LC. A positive solution of this conjecture would have implied that spheres with NN facets are at most CNC^{N}, for a constant CC – which would have been the desired missing link to implement discrete quantum gravity in three dimensions.

In the present paper, we show that the conjecture of Durhuus and Jonsson has a negative answer: There are simplicial 33-spheres that are not LC. (With this, however, we do not resolve the question whether there are fewer than CNC^{N} simplicial 33-spheres on NN facets, for some constant CC.)

On the way to this result, we provide a characterization of LC simplicial dd-complexes which relates the “locally constructible” spheres defined by physicists to concepts that originally arose in topological combinatorics.

A simplicial dd-sphere, d≥3d\geq 3, is LC if and only if the sphere after removal of one facet can be collapsed down to a complex of dimension d−2d-2. Furthermore, there are the following inclusion relations between families of simplicial dd-spheres:

We use the hierarchy in conjunction with the following extension and sharpening of Durhuus and Jonsson’s theorem (who discussed only the case d=3d=3).

For fixed d≥2d\geq 2, the number of combinatorially distinct simplicial LC dd-spheres with NN facets grows not faster than 2d2⋅N2^{d^{2}\cdot N}.

We will give a proof for this theorem in Section 4; the same type of upper bound, with the same type of proof, also holds for LC dd-balls with NN facets.

Already in 1988 Kalai constructed for every d≥4d\geq 4 a family of more than exponentially many dd-spheres on nn vertices; Lee later showed that all of Kalai’s spheres are shellable. Combining this with Theorem 4.4 and Theorem 2.1, we obtain the following asymptotic result:

For fixed d≥4d\geq 4, the number of shellable simplicial dd-spheres grows more than exponentially with respect to the number nn of vertices, but only exponentially with respect to the number NN of facets.

The hierarchy of Main Theorem 1 is not quite complete: It is still not known whether constructible, non-shellable 33-spheres exist (see ). A shellable 33-sphere that is not vertex-decomposable was found by Lockeberg in his 1977 Ph.D. work (reported in [33, p. 742]; see also ). Again, the 22-dimensional case is much simpler and completely solved: All 22-spheres are vertex decomposable (see ).

In order to show that not all spheres are LC we study in detail simplicial spheres with a “knotted triangle”; these are obtained by adding a cone over the boundary of a ball with a knotted spanning edge (as in Furch’s 1924 paper ; see also Bing ). Spheres with a knotted triangle cannot be boundaries of polytopes. Lickorish had shown in 1991 that

a 33-sphere with a knotted triangle is not shellable if the knot is at least 33-complicated.

Here “at least 33-complicated” refers to the technical requirement that the fundamental group of the complement of the knot has no presentation with less than four generators. A concatenation of three or more trefoil knots satisfies this condition. In 2000, Hachimori and Ziegler demonstrated that Lickorish’s technical requirement is not necessary for his result:

a 33-sphere with any knotted triangle is not constructible.

In the present work, we re-justify Lickorish’s technical assumption, showing that this is exactly what we need if we want to reach a stronger conclusion, namely, a topological obstruction to local constructibility. Thus, the following result is established in order to prove that the last inclusion of the hierarchy in Theorem 2.1 is strict.

A 33-sphere with a knotted triangle is not LC if the knot is at least 33-complicated.

The knot complexity requirement is now necessary, as non-constructible spheres with a single trefoil knot can still be LC (see Example 2.26).

The combinatorial topology of dd-balls and that of dd-spheres are of course closely related – our study builds on the well-known connections and also adds new ones.

A simplicial dd-ball is LC if and only if after the removal of a facet it collapses down to the union of the boundary with a complex of dimension at most d−2d-2. We have the following hierarchy:

All the inclusions of Main Theorem 4 hold with equality for simplicial 22-balls. In the case of d=3d=3, collapsibility onto a (d−2)(d-2)-complex is equivalent to collapsibility. In particular, we settle a question of Hachimori (see e.g. [23, pp. 54, 66]) whether all constructible 33-balls are collapsible.

Furthermore, we show in Corollary 3.24 that some collapsible 33-balls do not collapse onto their boundary minus a facet, a property that comes up in classical studies in combinatorial topology (compare ). In particular, a result of Chillingworth can be restated in our language as “if for any geometric simplicial complex Δ\Delta the support (union) ∣Δ∣|\Delta| is a convex 33-dimensional polytope, then Δ\Delta is necessarily an LC 33-ball”, see Theorem 3.27. Thus any geometric subdivision of the 33-simplex is LC.

In the following, we present the notion of “local constructibility” (due to Durhuus and Jonsson). Although in the end we are interested in this notion as applied to finite simplicial complexes, the iterative definition of locally constructible complexes dictates that for intermediate steps we must allow for the greater generality of finite “simplicial regular CW complexes”. A CW complex is regular if the attaching maps for the cells are injective on the boundary (see e.g. ). A regular CW-complex is simplicial if for every proper face FF, the interval [0,F][0,F] in the face poset of the complex is boolean. Every simplicial complex (and in particular, any triangulated manifold) is a simplicial regular CW-complex.

The kk-dimensional cells of a regular CW complex CC are called kk-faces; the inclusion-maximal faces are called facets, and the inclusion-maximal proper subfaces of the facets are called ridges. The dimension of CC is the largest dimension of a facet; pure complexes are complexes where all facets have the same dimension. All complexes that we consider in the following are finite, most of them are pure. A dd-complex is a dd-dimensional complex. Conventionally, the 0-faces are called vertices, and the 11-faces edges. (In the discrete quantum gravity literature, the (d−2)(d-2)-faces are sometimes called “hinges” or “bones”, whereas the edges are sometimes referred to as “links”.) If the union ∣C∣|C| of all simplices of CC is homeomorphic to a manifold MM, then CC is a triangulation of MM; if CC is a triangulation of a dd-ball or of a dd-sphere, we will call CC simply a dd-ball (resp. dd-sphere). The dual graph of a pure dd-dimensional simplicial complex CC is the graph whose nodes correspond to the facets of CC: Two nodes are connected by an arc if and only if the corresponding facets share a (d−1)(d-1)-face.

1.2 Knots

All the knots we consider are tame, that is, realizable as 11-dimensional subcomplexes of some triangulated 33-sphere. A knot is mm-complicated if the fundamental group of the complement of the knot in the 33-sphere has a presentation with m+1m+1 generators, but no presentation with mm generators. By “at least mm-complicated” we mean “kk-complicated for some k≥mk\geq m”. There exist arbitrarily complicated knots: Goodrick showed that the connected sum of mm trefoil knots is at least mm-complicated.

Another measure of how tangled a knot can be is the bridge index (see e.g. [32, p. 18] for the definition). If a knot has bridge index bb, the fundamental group of the knot complement admits a presentation with bb generators and b−1b-1 relations [32, p. 82]. In other words, the bridge index of a tt-complicated knot is at least t+1t+1. As a matter of fact, the connected sum of tt trefoil knots is tt-complicated, and its bridge index is exactly t+1t+1 .

1.3 The combinatorial topology hierarchy

In the following, we review the key properties from the inclusion

valid for all simplicial complexes, and the inclusion

applicable only for contractible simplicial complexes, both known from combinatorial topology (see [10, Sect. 11] for details).

Shellability can be defined for pure simplicial complexes as follows:

a dd-dimensional pure simplicial complex CC which is not a simplex is shellable if and only if it can be written as C=C1∪C2C=C_{1}\cup C_{2}, where C1C_{1} is a shellable dd-complex, C2C_{2} is a dd-simplex, and C1∩C2C_{1}\cap C_{2} is a shellable (d−1)(d-1)-complex.

Constructibility is a weakening of shellability, defined by:

a dd-dimensional pure simplicial complex CC which is not a simplex is constructible if and only if it can be written as C=C1∪C2C=C_{1}\cup C_{2}, where C1C_{1} and C2C_{2} are constructible dd-complexes, and C1∩C2C_{1}\cap C_{2} is a constructible (d−1)(d-1)-complex.

Let CC be a dd-dimensional simplicial complex. An elementary collapse is the simultaneous removal from CC of a pair of faces (σ,Σ)(\sigma,\Sigma) with the following prerogatives:

σ\sigma is not a proper face of any other face of CC.

(The three conditions above are usually abbreviated in the expression “σ\sigma is a free face of Σ\Sigma”; some complexes have no free face). If C′:=C−Σ−σC^{\prime}:=C-\Sigma-\sigma, we say that the complex CC collapses onto the complex C′C^{\prime}. We also say that the complex CC collapses onto the complex DD, and write C↘DC\searrow D, if CC can be reduced to DD by a finite sequence of elementary collapses. Thus a collapse refers to a sequence of elementary collapses. A collapsible complex is a complex that can be collapsed onto a single vertex.

Since C′:=C−Σ−σC^{\prime}:=C-\Sigma-\sigma is a deformation retract of CC, each collapse preserves the homotopy type. In particular, all collapsible complexes are contractible. The converse does not hold in general: For example, the so-called “dunce hat” is a contractible 22-complex without free edges, and thus with no elementary collapse to start with. However, the implication “contractible ⇒\Rightarrow collapsible” holds for all 11-complexes, and also for shellable complexes of any dimension.

A connected 22-dimensional complex is collapsible if and only if it does not contain a 22-dimensional complex without a free edge. In particular, for 22-dimensional complexes, if C↘DC\searrow D and DD is not collapsible, then CC is also not collapsible. This holds no more for complexes CC of dimension larger than two .

1.4 LC pseudomanifolds

By a dd-pseudomanifold [possibly with boundary] we mean a finite regular CW-complex PP that is pure dd-dimensional, simplicial, and such that each (d−1)(d-1)-dimensional cell belongs to at most two dd-cells. The boundary of the pseudomanifold PP, denoted ∂P\partial P, is the smallest subcomplex of PP containing all the (d−1)(d-1)-cells of PP that belong to exactly one dd-cell of PP.

According to our definition, a pseudomanifold needs not be a simplicial complex; it might be disconnected; and its boundary might not be a pseudomanifold.

For d≥2d\geq 2, let CC be a pure dd-dimensional simplicial complex with NN facets. A local construction for CC is a sequence T1,T2,…,TN,…,TkT_{1},T_{2},\ldots,T_{N},\ldots,T_{k} (k≥Nk\geq N) such that TiT_{i} is a dd-pseudomanifold for each ii and

if i≤N−1i\leq N-1, then Ti+1T_{i+1} is obtained from TiT_{i} by gluing a new dd-simplex to TiT_{i} alongside one of the (d−1)(d-1)-cells in ∂Ti\partial T_{i};

if i≥Ni\geq N, then Ti+1T_{i+1} is obtained from TiT_{i} by identifying a pair σ,τ\sigma,\tau of (d−1)(d-1)-cells in the boundary ∂Ti\partial T_{i} whose intersection contains a (d−2)(d-2)-cell FF;

We say that CC is locally constructible, or LC, if a local construction for CC exists. With a little abuse of notation, we will call each TiT_{i} an LC pseudomanifold. We also say that CC is locally constructed along TT, if TT is the dual graph of TNT_{N}, and thus a spanning tree of the dual graph of CC.

The identifications described in item (3) above are operations that are not closed with respect to the class of simplicial complexes. Local constructions where all steps are simplicial complexes produce only a very limited class of manifolds, consisting of dd-balls with no interior (d−3)(d-3)-faces. (When in an LC step the identified boundary facets intersect in exactly a (d−2)(d-2)-cell, no (d−3)(d-3)-face is sunk into the interior, and the topology stays the same.)

However, since by definition the local construction in the end must arrive at a pseudomanifold CC that is a simplicial complex, each intermediate step TiT_{i} must satisfy severe restrictions: for each t≤dt\leq d,

distinct tt-simplices that are not in the boundary of TiT_{i} share at most one (t−1)(t-1)-simplex;

distinct tt-simplices in the boundary of TiT_{i} that share more than one (t−1)(t-1)-simplex will need to be identified by the time the construction of CC is completed.

if σ,τ\sigma,\tau are the two (d−1)(d-1)-cells glued together in the step from TiT_{i} to Ti+1T_{i+1}, σ\sigma and τ\tau cannot belong to the same dd-simplex of TiT_{i}; nor can they belong to two dd-simplices that are already adjacent in TiT_{i}.

For example, in each step of the local construction of a 33-sphere, no two tetrahedra share more than one triangle. Moreover, any two distinct interior triangles either are disjoint, or they share a vertex, or they share an edge; but they cannot share two edges, nor three; and they also cannot share one edge and the opposite vertex. If we glued together two boundary triangles that belong to adjacent tetrahedra, no matter what we did afterwards, we would not end up with a simplicial complex any more. Roughly speaking,

a locally constructible 33-sphere is a triangulated 33-sphere obtained from a tree of tetrahedra TNT_{N} by repeatedly identifying two adjacent triangles in the boundary.

As we mentioned, the boundary of a pseudomanifold need not be a pseudomanifold. However, if PP is an LC dd-pseudomanifold, then ∂P\partial P is automatically a (d−1)(d-1)-pseudomanifold. Nevertheless, ∂P\partial P may be disconnected, and thus, in general, it is not LC.

All LC dd-pseudomanifolds are simply connected; in case d=3d=3, their topology is controlled by the following result.

Every LC 33-pseudomanifold PP is homeomorphic to a 33-sphere with a finite number of “cacti of 33-balls” removed. (A cactus of 33-balls is a tree-like connected structure in which any two 33-balls share at most one point.) Thus the boundary ∂P\partial P is a finite disjoint union of cacti of 22-spheres. In particular, each connected component of ∂P\partial P is a simply-connected 22-pseudomanifold.

Thus every closed 33-dimensional LC pseudomanifold is a sphere, while for d>3d>3 other topological types such as products of spheres are possible (see Benedetti ).

On LC Spheres

In this section, we establish the following hierarchy announced in the introduction.

For all d≥3d\geq 3, we have the following inclusion relations between families of simplicial dd-spheres:

The first two inclusions, and strictness of the first one, are known; the third one will follow from Lemma 2.23 and will be shown to be strict by Example 2.26 together with Lemma 2.24; finally, Corollary 2.22 will establish the strictness of the fourth inclusion for all d≥3d\geq 3.∎

Let SS be a simplicial dd-sphere (d≥2d\geq 2), and TT a spanning tree of the dual graph of SS. We denote by KTK^{T} the subcomplex of SS formed by all the (d−1)(d-1)-faces of SS that are not intersected by TT.

Let SS be any dd-sphere with NN facets. Then for every spanning tree TT of the dual graph of SS,

KTK^{T} is a contractible pure (d−1)(d-1)-dimensional simplicial complex with dN−N+22\frac{dN-N+2}{2} facets;

for any facet Δ\Delta of SS,     S−Δ  ↘KT\;\;S-\Delta\;\searrow K^{T}.

Any collapse of a dd-sphere SS minus a facet Δ\Delta to a complex of dimension at most d−1d-1 proceeds along a dual spanning tree TT. To see this, fix a collapsing sequence. We may assume that the collapse of S−ΔS-\Delta is ordered so that the pairs ((d−1)-face,  d-face)((d-1)\textrm{-face},\;d\textrm{-face}) are removed first. Whenever both the following conditions are met:

σ\sigma is the (d−1)(d-1)-dimensional intersection of the facets Σ\Sigma and Σ′\Sigma^{\prime} of SS;

the pair (σ,Σ)(\sigma,\Sigma) is removed in the collapsing sequence of S−ΔS-\Delta,

draw an oriented arrow from the center of Σ′\Sigma^{\prime} to the center of Σ\Sigma. This yields a directed spanning tree TT of the dual graph of SS, where Δ\Delta is the root. Indeed, TT is spanning because all dd-simplices of S−ΔS-\Delta are removed in the collapse; it is connected, because the only free (d−1)(d-1)-faces of S−ΔS-\Delta, where the collapse can start at, are the proper (d−1)(d-1)-faces of the “missing simplex” Δ\Delta; it is acyclic, because the center of each dd-simplex of S−ΔS-\Delta is reached by exactly one arrow. We will say that the collapsing sequence acts along the tree TT (in its top-dimensional part). Thus the complex KTK^{T} appears as intermediate step of the collapse: It is the complex obtained after the (N−1)(N-1)st pair of faces has been removed from S−ΔS-\Delta.

By a facet-killing sequence for a dd-dimensional simplicial complex CC we mean a sequence C0,C1,…,Ct−1,CtC_{0},C_{1},\ldots,C_{t-1},C_{t} of complexes such that t=fd(C)t=f_{d}(C), C0=CC_{0}=C, and Ci+1C_{i+1} is obtained by an elementary collapse that removes a free (d−1)(d-1)-face σ\sigma of CiC_{i}, together with the unique facet Σ\Sigma containing σ\sigma.

If CC is a dd-complex, and DD is a lower-dimensional complex such that C↘DC\searrow D, there exists a facet-killing sequence C0C_{0}, …\ldots, CtC_{t} for CC such that Ct↘DC_{t}\searrow D. In other words, the collapse of CC onto DD can be rearranged so that the pairs ((d−1)-face, d-face)\left((d-1)\textrm{-face},\,d\textrm{-face}\right) are removed first. In particular, for any dd-complex CC, the following are equivalent:

there exists a facet-killing sequence for CC;

there exists a kk-complex DD with k≤d−1k\leq d-1 such that C↘DC\searrow D.

What we argued before can be rephrased as follows:

Let SS be a dd-sphere, and Δ\Delta a dd-simplex of SS. Let CC be a kk-dimensional simplicial complex, with k≤d−2k\leq d-2. Then,

The right-hand side in the equivalence of Proposition 2.4 does not depend on the Δ\Delta chosen. So, for any dd-sphere Δ\Delta, either S−ΔS-\Delta is collapsible for every Δ\Delta, or S−ΔS-\Delta is not collapsible for any Δ\Delta.

One more convention: by a natural labeling of a rooted tree TT on nn vertices we mean a bijection b:V(T)⟶{1,…,n}b:V(T)\longrightarrow\{1,\ldots,n\} such that if vv is the root, b(v)=1b(v)=1, and if vv is not the root, there exists a unique vertex ww adjacent to vv such that b(w)<b(v)b(w)<b(v).

We are now ready to link the LC concept with collapsibility. Take a dd-sphere SS, a facet Δ\Delta of SS, and a rooted spanning tree TT of the dual graph of SS, with root Δ\Delta. Since SS is given, fixing TT is really the same as fixing the manifold TNT_{N} in the local construction of SS; and at the same time, fixing TT is the same as fixing KTK^{T}.

Once TT, TNT_{N}, and KTK^{T} have been fixed, to describe the first part of a local construction of SS (that is, T1,…,TNT_{1},\ldots,T_{N}) we just need to specify the order in which the tetrahedra of SS have to be added, which is the same as to give a natural labeling of TT. Besides, natural labelings of TT are in bijection with collapses S−Δ↘KTS-\Delta\searrow K^{T} (the ii-th facet to be collapsed is the node of TT labeled i+1i+1; see Proposition 2.4).

What if we do not fix TT? Suppose SS and Δ\Delta are fixed. Then the previous reasoning yields a bijection among the following sets:

the set of all facet-killing sequences of S−ΔS-\Delta;

the set of “natural labelings” of spanning trees of SS, rooted at Δ\Delta;

the set of the first parts (T1,…,TN)(T_{1},\ldots,T_{N}) of local constructions for SS, with T1=ΔT_{1}=\Delta.

Can we understand also the second part of a local construction “combinatorially”? Let us start with a variant of the “facet-killing sequence” notion.

A pure facet-massacre of a pure dd-dimensional simplicial complex PP is a sequence P0,P1,…,Pt−1,PtP_{0},P_{1},\ldots,P_{t-1},P_{t} of (pure) complexes such that t=fd(P)t=f_{d}(P), P0=PP_{0}=P, and Pi+1P_{i+1} is obtained by PiP_{i} removing:

(a) a free (d−1)(d-1)-face σ\sigma of PiP_{i}, together with the unique facet Σ\Sigma containing σ\sigma, and

(b) all inclusion-maximal faces of dimension smaller than dd that are left after the removal of type (a) or, recursively, after removals of type (b).

In other words, the (b) step removes lower-dimensional facets until one obtains a pure complex. Since t=fd(P)t=f_{d}(P), PtP_{t} has no facets of dimension dd left, nor inclusion-maximal faces of smaller dimension; hence PtP_{t} is empty. The other PiP_{i}’s are pure complexes of dimension dd. Notice that the step Pi⟶Pi+1P_{i}\longrightarrow P_{i+1} is not a collapse, and does not preserve the homotopy type in general. Of course Pi⟶Pi+1P_{i}\longrightarrow P_{i+1} can be “factorized” in an elementary collapse followed by a removal of a finite number of kk-faces, with k<dk<d. However, this factorization is not unique, as the next example shows.

Let PP be a full triangle. PP admits three different facet-killing collapses (each edge can be chosen as free face), but it admits only one pure facet-massacre, namely P,∅P,\emptyset.

Let PP be a pure dd-dimensional simplicial complex. Every facet-killing sequence of PP naturally induces a unique pure facet-massacre of PP. All pure facet-massacres of PP are induced by some (possibly more than one) facet-killing sequence.

The map consists in taking a facet-killing sequence C0C_{0}, …\ldots, CtC_{t}, and “cleaning up” the CiC_{i} by recursively killing the lower-dimensional inclusion-maximal faces. As the previous example shows, this map is not injective. It is surjective essentially because the removed lower-dimensional faces are of dimension “too small to be relevant”. In fact, their dimension is at most d−1d-1, hence their presence can interfere only with the freeness of faces of dimension at most d−2d-2; so the list of all removals of the form ((d−1)-face, d-face)((d-1)\hbox{-face},\,d\hbox{-face}) in a facet-massacre yields a facet-killing sequence. ∎

Let SS be a dd-sphere; fix a spanning tree TT of the dual graph of SS. The second part of a local construction for SS along TT corresponds bijectively to a facet-massacre of KTK^{T}.

Fix SS and TT; TNT_{N} and KTK^{T} are determined by this. Let us start with a local construction (T1,…,TN−1,)TN,…,Tk\left(T_{1},\ldots,T_{N-1},\right)T_{N},\ldots,T_{k} for SS along TT. Topologically, S=TN/∼S=T_{N}/{\sim}, where ∼{\sim} is the equivalence relation determined by the gluing (two distinct points of TNT_{N} are equivalent if and only if they will be identified in the gluing). Moreover, KT=∂TN/∼K^{T}=\partial T_{N}/{\sim}, by the definition of KTK^{T}.

Define P0:=KT=∂TN/∼P_{0}:=K^{T}=\partial T_{N}/{\sim}, and Pj:=∂TN+j/∼P_{j}:=\partial T_{N+j}/{\sim}. We leave it to the reader to verify that k−Nk-N and fd(KT)f_{d}(K^{T}) are the same integer (see Lemma 2.2), which from now on is called DD. In particular PD=∂Tk/∼=∂S/∼=∅P_{D}=\partial T_{k}/{\sim}=\partial S/{\sim}=\emptyset.

In the first LC step, TN→TN+1T_{N}\rightarrow T_{N+1}, we remove from the boundary a free ridge rr, together with the unique pair σ′,σ′′\sigma^{\prime},\sigma^{\prime\prime} of facets of ∂TN\partial T_{N} sharing rr. At the same time, rr and the newly formed face σ\sigma are sunk into the interior. This step ∂TN⟶∂TN+1\partial T_{N}\longrightarrow\partial T_{N+1} naturally induces an analogous step ∂TN+j/∼⟶∂TN+j+1/∼\partial T_{N+j}/{\sim}\longrightarrow\partial T_{N+j+1}/{\sim}, namely, the removal of rr and of the (unique!) (d−1)(d-1)-face σ\sigma containing it.

In the jj-th LC step, ∂TN+j⟶∂TN+j+1\partial T_{N+j}\longrightarrow\partial T_{N+j+1}, we remove from the boundary a ridge rr together with a pair σ′,σ′′\sigma^{\prime},\sigma^{\prime\prime} of facets sharing rr; moreover, we sink into the interior a lower-dimensional face FF if and only if we have just sunk into the interior all faces containing FF. The induced step from ∂TN+j/∼\partial T_{N+j}/{\sim} to ∂TN+j+1/∼\partial T_{N+j+1}/{\sim} is precisely a “facet-massacre” step.

For the converse, we start with a “facet-massacre” P0P_{0}, …, PDP_{D} of KTK^{T}, and we have P0=KT=∂TN/∼P_{0}=K_{T}=\partial T_{N}/{\sim}. The unique (d−1)(d-1)-face σj\sigma_{j} killed in passing from PjP_{j} to Pj+1P_{j+1} corresponds to a unique pair of (adjacent!) (d−1)(d-1)-faces σj′\sigma_{j}^{\prime}, σj′′\sigma_{j}^{\prime\prime} in ∂TN+j\partial T_{N+j}. Gluing them together is the LC move that transforms TN+jT_{N+j} into TN+j+1T_{N+j+1}. ∎

The first part of a local construction along a tree TT corresponds to a facet-killing collapse of S−ΔS-\Delta (that ends in KTK^{T}).

The second part of a local construction along a tree TT corresponds to a pure facet-massacre of KTK^{T}.

A single facet-massacre of KTK^{T} corresponds to many facet-killing sequences of KTK^{T}.

By Proposition 2.4, there exists a facet-killing sequence of KTK^{T} if and only if KTK^{T} collapses onto some (d−2)(d-2)-dimensional complex CC. This CC is necessarily contractible, like KTK^{T}.

So SS is locally constructible along TT if and only if KTK^{T} collapses onto some (d−2)(d-2)-dimensional contractible complex CC, if and only if KTK^{T} has a facet-killing sequence. What if we do not fix TT?

Let SS be a dd-sphere (d≥3d\geq 3). Then the following are equivalent:

for some spanning tree TT of SS, KTK^{T} is collapsible onto some (d−2)(d-2)-dimensional (contractible) complex CC;

there exists a (d−2)(d-2)-dimensional (contractible) complex CC such that for every facet Δ\Delta of SS, S−Δ↘CS-\Delta\searrow C;

for some facet Δ\Delta of SS, S−ΔS-\Delta is collapsible onto a (d−2)(d-2)-dimensional contractible complex CC.

SS is LC if and only if it is LC along some tree TT; thus (1)⇔(2)(1)\Leftrightarrow(2) follows from Remark 2.9. Besides, (2)⇒(3)(2)\Rightarrow(3) follows from the fact that S−Δ  ↘KTS-\Delta\;\searrow K^{T} (Lemma 2.2), where KTK^{T} is independent of the choice of Δ\Delta. (3)⇒(4)(3)\Rightarrow(4) is trivial. To show (4)⇒(2)(4)\Rightarrow(2), take a collapse of S−ΔS-\Delta onto some (d−2)(d-2)-complex CC; by Lemma 2.4, there exists some tree TT (along which the collapse acts) so that S−Δ↘KTS-\Delta\searrow K^{T} and KT↘CK^{T}\searrow C. ∎

Let SS be a 33-sphere. Then the following are equivalent:

KTK^{T} is collapsible, for some spanning tree TT of the dual graph of SS;

S−ΔS-\Delta is collapsible for every facet Δ\Delta of SS;

S−ΔS-\Delta is collapsible for some facet Δ\Delta of SS.

This follows from the previous theorem, together with the fact that all contractible 11-complexes are collapsible. ∎

We are now in the position to exploit results by Lickorish about collapsibility.

Let L\mathfrak{L} be a knot on mm edges in the 11-skeleton of a simplicial 33-sphere SS. Suppose that S−ΔS-\Delta is collapsible, where Δ\Delta is some tetrahedron in S−LS-\mathfrak{L}. Then ∣S∣−∣L∣|S|-|\mathfrak{L}| is homotopy equivalent to a connected cell complex with one 0-cell and at most mm 11-cells. In particular, the fundamental group of ∣S∣−∣L∣|S|-|\mathfrak{L}| admits a presentation with mm generators.

Now assume that a certain sphere SS containing a knot L\mathfrak{L} is LC. By Corollary 2.11, S−ΔS-\Delta is collapsible, for any tetrahedron Δ\Delta not in the knot L\mathfrak{L}. Hence by Lickorish’s criterion the fundamental group π1(∣S∣−∣L∣)\pi_{1}\left(|S|-|\mathfrak{L}|\right) admits a presentation with mm generators.

Any 33-sphere with a 33-complicated 33-edge knot is not LC. More generally, a 33-sphere with an mm-gonal knot cannot be LC if the knot is at least mm-complicated.

As in the construction of the classical “Furch–Bing ball” [16, p. 73] [9, p. 110] , we drill a hole into a finely triangulated 33-ball along a triple pike dive of three consecutive trefoils; we stop drilling one step before destroying the property of having a ball (see Figure 3). If we add a cone over the boundary, the resulting sphere has a three edge knot which is a connected sum of three trefoil knots. By Goodrick the connected sum of mm copies of the trefoil knot is at least mm-complicated. So, this sphere has a knotted triangle, the fundamental group of whose complement has no presentation with 33 generators. Hence SS cannot be LC.

From this we get a negative answer to the Durhuus–Jonsson conjecture:

Lickorish proved also a higher-dimensional statement, basically by taking successive suspensions of the 3-sphere in Example 2.14.

For each d≥3d\geq 3, there exists a PL dd-sphere SS such that S−ΔS-\Delta is not collapsible for any facet Δ\Delta of SS.

To exploit our Theorem 2.10 we need a sphere SS such that S−ΔS-\Delta is not even collapsible to a (d−2)(d-2)-complex. To establish that such a sphere exists, we strengthen Lickorish’s result.

Let KK be a dd-manifold, AA an rr-simplex in KK, and A^\hat{A} the barycenter of AA. Consider the barycentric subdivision sd(K)sd(K) of KK. The dual A∗A^{*} of AA is the subcomplex of sd(K)sd(K) given by all flags

where r=dim⁡Ar=\dim A, and dim⁡Ai+1=dim⁡Ai+1\dim A_{i+1}=\dim A_{i}+1 for each ii.

A∗A^{*} is a cone with apex A^\hat{A}, and thus collapsible. If KK is PL (see e.g. Hudson for the definition), we can say more:

Let KK be a PL dd-manifold (without boundary), and let AA be a simplex in KK of dimension rr. Then

if AA is a face of an (r+1)(r+1)-simplex BB, then B∗B^{*} is a (d−r−1)(d-r-1)-subcomplex of ∂ A∗\partial\,A^{*}.

We have observed in Lemma 2.2 that for any dd-sphere SS and any facet Δ\Delta the ball S−ΔS-\Delta is collapsible onto a (d−1)(d-1)-complex: In other words, via collapses one can always get one dimension down. To get two dimensions down is not so easy: Our Theorem 2.10 states that S−ΔS-\Delta is collapsible onto a (d−2)(d-2)-complex precisely when SS is LC.

This “number of dimensions down you can get by collapsing” can be related to the minimal presentations of certain homotopy groups. The idea of the next theorem is that if one can get kk dimensions down by collapsing a manifold minus one facet, then the (k−1)(k-1)-th homotopy group of the complement of any (d−k)(d-k)-subcomplex of the manifold cannot be too complicated to present.

Let tt, dd with 0≤t≤d−20\leq t\leq d-2, and let KK be a PL dd-manifold (without boundary). Suppose that K−ΔK-\Delta collapses onto a tt-complex, for some facet Δ\Delta of KK. Then, for each tt-dimensional subcomplex L\mathfrak{L} of KK, the homotopy group

has a presentation with ft(L)f_{t}(\mathfrak{L}) generators, while πi(∣K∣−∣L∣)\pi_{i}(|K|-|\mathfrak{L}|) is trivial for i<d−t−1i<d-t-1.

As usual, we assume that the collapse of K−ΔK-\Delta is ordered so that:

first all pairs ((d−1)-face,  d-face)((d-1)\textrm{-face},\;d\textrm{-face}) are collapsed;

then all pairs ((d−2)-face,  (d−1)-face)((d-2)\textrm{-face},\;(d-1)\textrm{-face}) are collapsed;

finally, all pairs (t-face,  (t+1)-face)(t\textrm{-face},\;(t+1)\textrm{-face}) are collapsed.

Let us put together all the faces that appear above, maintaining their order, to form a single list of simplices

In such a list A1A_{1} is a free face of A2A_{2}; A3A_{3} is a free face of A4A_{4} with respect to the complex K−A1−A2K-A_{1}-A_{2}; and so on. In general, A2i−1A_{2i-1} is a face of A2iA_{2i} for each ii, and in addition, if j>2ij>2i, A2i−1A_{2i-1} is not a face of AjA_{j}.

We set X0=A0:=Δ^X_{0}=A_{0}:=\hat{\Delta} and define a finite sequence X1,…,XMX_{1},\ldots,X_{M} of subcomplexes of sd(K)sd(K) as follows:

None of the A2iA_{2i}’s can be in L\mathfrak{L}, because L\mathfrak{L} is tt-dimensional and dim⁡A2i≥dim⁡A2M=t+1\dim A_{2i}\geq\dim A_{2M}=t+1. However, exactly ft(L)f_{t}(\mathfrak{L}) of the A2i−1A_{2i-1}’s are in L\mathfrak{L}. Consider how XjX_{j} differs from Xj−1X_{j-1}. There are two cases:

By Lemma 2.18, setting r=dim⁡A2j−1r=\dim A_{2j-1}, A2j−1∗A^{*}_{2j-1} is a (d−r)(d-r)-ball that contains in its boundary the (d−r−1)(d-r-1)-ball A2j∗A^{*}_{2j}. Thus ∣Xj∣|X_{j}| is just ∣Xj−1∣|X_{j-1}| with a (d−r)(d-r)-cell attached via a cell in its boundary, and such an attachment does not change the homotopy type.

As this occurs only when dim⁡A2j−1=t\dim A_{2j-1}=t, we have that dim⁡A2j=t+1\dim A_{2j}=t+1 and dim⁡A2j∗=d−t−1\dim A^{*}_{2j}=d-t-1; hence ∣Xj∣|X_{j}| is just ∣Xj−1∣|X_{j-1}| with a (d−t−1)(d-t-1)-cell attached via its whole boundary.

Only in the second case the homotopy type of ∣Xj∣|X_{j}| changes at all, and this second case occurs exactly ft(L)f_{t}(\mathfrak{L}) times. Since X0X_{0} is one point, it follows that XMX_{M} is homotopy equivalent to a bouquet of ft(L)f_{t}(\mathfrak{L}) many (d−t−1)(d-t-1)-spheres.

Now let us list by (weakly) decreasing dimension the faces of KK that do not appear in the previous list A1,A2,…,A2M−1,A2MA_{1},A_{2},\ldots,A_{2M-1},A_{2M}. We name the elements of this list

(where ∑i=1dfi(K)=F+1\sum_{i=1}^{d}f_{i}(K)=F+1 because all faces appear in A0,…,AFA_{0},\ldots,A_{F}).

Correspondingly, we recursively define a new sequence of subcomplexes of sd(K)sd(K) setting Y0:=XMY_{0}:=X_{M} and

Since dim⁡A2M+h≤dim⁡A2M+1=t\dim A_{2M+h}\leq\dim A_{2M+1}=t, we have that ∣Yh∣|Y_{h}| is just ∣Yh−1∣|Y_{h-1}| with possibly a cell of dimension at least d−td-t attached via its whole boundary. Let us consider the homotopy groups of the YhY_{h} ’s : Recall that Y0Y_{0} was homotopy equivalent to a bouquet of ft(L)f_{t}(\mathfrak{L}) (d−t−1)(d-t-1)-spheres. Clearly, for all hh,

Moreover, the higher-dimensional cell attached to ∣Yh−1∣|Y_{h-1}| to get ∣Yh∣|Y_{h}| corresponds to the addition of relators to a presentation of πd−t−1(Yh−1)\pi_{d-t-1}(Y_{h-1}) to get a presentation of πd−t−1(Yh)\pi_{d-t-1}(Y_{h}). This means that for all hh the group πd−t−1(Yh)\pi_{d-t-1}(Y_{h}) is generated by (at most) ft(L)f_{t}(\mathfrak{L}) elements.

The conclusion follows from the fact that, by construction, YF−2MY_{F-2M} is the subcomplex of sd(K)sd(K) consisting of all simplices of sd(K)sd(K) that have no vertex in sd(L)sd(\mathfrak{L}); and one can easily prove (see [36, Lemma 1]) that such a complex is a deformation retract of ∣K∣−∣L∣|K|-|\mathfrak{L}|. ∎

Let SS be a PL dd-sphere with a (d−2)(d-2)-dimensional subcomplex L\mathfrak{L}. If the fundamental group of ∣S∣−∣L∣|S|-|\mathfrak{L}| has no presentation with fd−2(L)f_{d-2}(\mathfrak{L}) generators, then SS is not LC.

Set t=d−2t=d-2 in Theorem 2.19, and apply Theorem 2.10. ∎

Fix an integer d≥3d\geq 3. Let SS be a 33-sphere with an mm-gonal knot in its 1-skeleton, so that the knot is at least (m⋅2d−3)(m\cdot 2^{d-3})-complicated. Then the (d−3)(d-3)-rd suspension of SS is a PL dd-sphere that is not LC.

Let S′S^{\prime} be the (d−3)(d-3)-rd suspension of SS, and let L′\mathfrak{L}^{\prime} be the subcomplex of S′S^{\prime} obtained taking the (d−3)(d-3)-rd suspension of the mm-gonal knot L\mathfrak{L}. Since ∣S∣−∣L∣|S|-|\mathfrak{L}| is a deformation retract of ∣S′∣−∣L′∣|S^{\prime}|-|\mathfrak{L}^{\prime}|, they have the same homotopy groups. In particular, the fundamental group of ∣S′∣−∣L′∣|S^{\prime}|-|\mathfrak{L}^{\prime}| has no presentation with m⋅2d−3m\cdot 2^{d-3} generators. Now L′\mathfrak{L}^{\prime} is (d−2)(d-2)-dimensional, and

whence we conclude via Corollary 2.20, since all 33-spheres are PL (and the PL property is maintained by suspensions). ∎

For every d≥3d\geq 3, not all PL dd-spheres are LC.

Theorem 2.19 can be used in connection with the existence of 22-knots, that is, 22-spheres embedded in a 44-sphere in a knotted way (see Kawauchi [32, p. 190]), to see that there are many non-LC 44-spheres beyond those that arise by suspension of 33-spheres. Thus, being “non-LC” is not simply induced by classical knots.

2 Many spheres are LC

Next we show that all constructible manifolds are LC.

Let CC be a dd-pseudomanifold. If CC can be split in the form C=C1∪C2C=C_{1}\cup C_{2}, where C1C_{1} and C2C_{2} are LC dd-pseudomanifolds and C1∩C2C_{1}\cap C_{2} is a strongly connected (d−1)(d-1)-pseudomanifold, then CC is LC.

Notice first that C1∩C2=∂C1∩∂C2C_{1}\cap C_{2}=\partial C_{1}\cap\partial C_{2}. In fact, every ridge of CC belongs to at most two facets of CC, hence every (d−1)(d-1)-face σ\sigma of C1∩C2C_{1}\cap C_{2} is contained in exactly one dd-face of C1C_{1} and in exactly one dd-face of C2C_{2}.

Each CiC_{i} is LC; let us fix a local construction for each of them, and call TiT_{i} the tree along which CiC_{i} is locally constructed. Choose some (d−1)(d-1)-face σ\sigma in C1∩C2C_{1}\cap C_{2}, which thus specifies a (d−1)(d-1)-face in the boundary of C1C_{1} and of C2C_{2}. Let C′C^{\prime} be the pseudomanifold obtained attaching C1C_{1} to C2C_{2} along the two copies of σ\sigma. C′C^{\prime} can be locally constructed along the tree obtained by joining T1T_{1} and T2T_{2} by an edge across σ\sigma: Just redo the same moves of the local constructions of the CiC_{i}’s. So C′C^{\prime} is LC.

If C1∩C2C_{1}\cap C_{2} consists of one simplex only, then C′≡CC^{\prime}\equiv C and we are already done. Otherwise, by the strongly connectedness assumption, the facets of C1∩C2C_{1}\cap C_{2} can be labeled 0,1,…,m0,1,\ldots,m, so that:

each facet labeled by k≥1k\geq 1 is adjacent to some facet labeled jj with j<kj<k.

Now for each i≥1i\geq 1, glue together the two copies of the facet ii inside C′C^{\prime}. All these gluings are local because of the labeling chosen, and we eventually obtain CC. Thus, CC is LC. ∎

Since all constructible simplicial complexes are pure and strongly connected , we obtain for simplicial dd-pseudomanifolds that

The previous containment is strict: Let C1C_{1} and C2C_{2} be two LC simplicial 33-balls on 77 vertices consisting of 77 tetrahedra, as indicated in Figure 4. (The 33-balls are cones over the subdivided triangles on their fronts.)

Glue them together in the shaded strongly connected subcomplex in their boundary (which uses 55 vertices and 44 triangles). The resulting simplicial complex CC, on 99 vertices and 1414 tetrahedra, is LC by Lemma 2.23, but the link of the top vertex is an annulus, and hence not LC. In fact, the complex CC is not constructible, since the link of the top vertex is not constructible. Also, CC is not 22-connected, it retracts to a 22-sphere. So, LC dd-pseudomanifolds are not necessarily (d−1)(d-1)-connected. Since all constructible dd-complexes are (d−1)(d-1)-connected, and every constructible dd-pseudomanifold is either a dd-sphere or a dd-ball [25, Prop. 1.4, p. 374], the previous argument produces many examples of dd-pseudomanifolds with boundary that are LC, but not constructible.

None of these examples, however, will be a sphere (or a ball). We will prove in Theorem 3.16 that there are LC 33-balls that are not constructible; we show now that for dd-spheres, for every d≥3d\geq 3, the containment {constructible}⊆{LC}\{\textrm{constructible}\}\subseteq\{\textrm{LC}\} is strict.

Suppose that a 33-sphere Sˉ\bar{S} is LC but not constructible. Then for all d≥3d\geq 3, the (d−3)(d-3)-rd suspension of Sˉ\bar{S} is a dd-sphere that is also LC but not constructible.

Whenever SS is an LC sphere, v∗Sv*S is an LC (d+1)(d+1)-ball. (The proof is straightforward from the definition of “local construction”.) Thus the suspension (v∗S)∪(w∗S)(v*S)\cup(w*S) is also LC by Lemma 2.23. On the other hand, the suspension of a non-constructible sphere is a non-constructible sphere [26, Corollary 2]. ∎

Of course, we should better show that the 33-sphere Sˉ\bar{S} in the assumption of Lemma 2.24 really exists. This will be established in Example 2.26, using Corollary 2.11 as follows.

Let BB be a 33-ball, vv an external point, and B∪v∗∂BB\cup v*\partial B the 33-sphere obtained by adding to BB a cone over its boundary. If BB is collapsible, then B∪v∗∂BB\cup v*\partial B is LC.

By Corollary 2.11, and since BB is collapsible, all we need to prove is that (B∪v∗∂B)−(v∗σ)(B\cup v*\partial B)-(v*\sigma) collapses onto BB, for some triangle σ\sigma in the boundary of BB.

As all 22-balls are collapsible, and ∂B−σ\partial B-\sigma is a 22-ball, there is some vertex PP in ∂B\partial B such that ∂B−σ↘P\partial B-\sigma\searrow P. This naturally induces a collapse of v∗∂B  −  v∗σv*\partial B\;-\;v*\sigma onto ∂B ∪ v∗P\partial B\,\cup\,v*P, according to the correspondence

Collapsing the edge v∗Pv*P down to PP, we get v∗∂B  −  v∗σ↘∂Bv*\partial B\;-\;v*\sigma\searrow\partial B.

In the collapse given here, the pairs of faces removed are all of the form (v∗σ,v∗Σ)(v*\sigma,v*\Sigma); thus, the (d−1)(d-1)-faces in ∂B\partial B are removed together with subfaces (and not with superfaces) in the collapse. This means that the freeness of the faces in ∂B\partial B is not needed; so when we glue back BB the collapse v∗∂B  −  v∗σ↘∂Bv*\partial B\;-\;v*\sigma\searrow\partial B can be read off as B  ∪  v∗∂B  −  v∗σ  ↘  B.B\;\cup\;v*\partial B\;-\;v*\sigma\;\searrow\;B. ∎

In , Lickorish and Martin described a collapsible 33-ball BB with a knotted spanning edge. This was also obtained independently by Hamstrom and Jerrard . The knot is an arbitrary 22-bridge index knot (for example, the trefoil knot). Merging BB with the cone over its boundary, we obtain a knotted 3-sphere Sˉ\bar{S} which is LC (by Lemma 2.25; see also ) but not constructible (because it is knotted; see [23, p. 54] or ).

In his 1991 paper [36, p. 530], Lickorish announced (for a proof see [8, pp. 100–103]) that “with a little ingenuity” one can get a sphere SS with a 22-complicated triangular knot (the double trefoil), such that S−ΔS-\Delta is collapsible. Such a sphere is LC by Corollary 2.11.

The triangulated knotted 33-sphere S13,563S^{3}_{13,56} realized by Lutz has 1313 vertices and 5656 facets. Since it contains a 33-edge trefoil knot in its 11-skeleton, S13,563S^{3}_{13,56} cannot be constructible, according to Hachimori and Ziegler .

Let B13,55B_{13,55} be the 33-ball obtained removing the facet Δ={1,2,6,9}\Delta=\{1,2,6,9\} from S13,563S^{3}_{13,56}. Let σ\sigma be the triangle {2,6,9}\{2,6,9\}. Then B13,553B^{3}_{13,55} collapses to the 22-disc ∂Δ−σ\partial\Delta-\sigma (F. H. Lutz, personal communication; see [8, pp. 106–107]). All 22-discs are collapsible. In particular, B13,553B^{3}_{13,55} is collapsible, so S13,563S^{3}_{13,56} is LC.

For each d≥3d\geq 3, not all LC dd-spheres are constructible. In particular, a knotted 33-sphere can be LC (but it is not constructible) if the knot is just 11-complicated or 22-complicated.

The knot in the 11-skeleton of the ball BB in Example 2.26 consists of a path on the boundary of BB together with a “spanning edge”, that is, an edge in the interior of BB with both extremes on ∂B\partial B. This edge determines the knot, in the sense that any other path on ∂B\partial B between the two extremes of this edge closes it up into an equivalent knot. For these reasons such an edge is called a knotted spanning edge. More generally, a knotted spanning arc is a path of edges in the interior of a 33-ball, such that both extremes of the path lie on the boundary of the ball, and any boundary path between these extremes closes it into a knot. (According to this definition, the relative interior of a knotted spanning arc is allowed to intersect the boundary of the 33-ball; this is the approach of Hachimori and Ehrenborg in .)

The Example 2.26 can then be generalized by adopting the idea that Hamstrom and Jerrard used to prove their “Theorem B” [27, p. 331], as follows.

Let KK be any 22-bridge knot (e.g. the trefoil knot). For any positive integer mm, there exists a collapsible 33-ball BmB_{m} with a knotted spanning arc of mm edges, such that the knot is the connected union of mm copies of KK.

By the work of Lickorish–Martin (see also and Example 2.26) there exists a collapsible 33-ball BB with a knotted spanning edge [x,y][x,y], the knot being KK. So if m=1m=1 we are already done.

Otherwise, take mm copies B(1)B^{(1)}, …\ldots, B(m)B^{(m)} of the ball BB and glue them all together by identifying the vertex y(i)y^{(i)} of B(i)B^{(i)} with the vertex x(i+1)x^{(i+1)} of B(i+1)B^{(i+1)}, for each ii in {1,…,m−1}\{1,\ldots,m-1\}. The result is a cactus of 33-balls CmC_{m}. By induction on mm, it is easy to see that a cactus of mm collapsible 33-balls is collapsible. To obtain a 33-ball from CmC_{m}, we thicken the junctions between the 33-balls by attaching m−1m-1 square pyramids with apex y(i)≡x(i+1)y^{(i)}\equiv x^{(i+1)}. Each pyramid can be triangulated into two tetrahedra to make the final complex simplicial. Let BmB_{m} be the resulting 33-ball. All the spanning edges of the B(i)B^{(i)}’s are concatenated in BmB_{m} to yield a knotted spanning arc of mm edges, the knot being equivalent to the mm-ple connected union of KK with himself. Moreover, the “extra pyramids” introduced can be collapsed away. This yields a collapse of the ball BmB_{m} onto the complex CmC_{m}, which is collapsible. ∎

A 33-sphere with an mm-complicated (m+2)(m+2)-gonal knot can be LC.

Let Sm=Bm∪(v∗∂Bm)S_{m}=B_{m}\cup(v*\partial B_{m}), where BmB_{m} is the 33-ball constructed in the previous theorem. By Lemma 2.25, SmS_{m} is LC. The spanning arc of mm edges is closed up in vv to form an (m+2)(m+2)-gon. ∎

The bound given by Corollary 2.31 can be improved: In fact, for each positive integer mm there exists an LC 33-sphere with an (m+1)(m+1)-complicated (m+2)(m+2)-gonal knot. The proof is rather long, so we preferred to omit it, referring the reader to [8, pp. 100–103].

The spheres mentioned in Corollary 2.31 and Corollary Remark 2.32 are not vertex decomposable, not shellable and not constructible, because of the following result about the bridge index.

Suppose that a 33-sphere (or a 33-ball) SS contains a knot of mm edges.

If the bridge index of the knot exceeds m3\frac{m}{3}, then SS is not vertex decomposable;

If the bridge index of the knot exceeds m2\frac{m}{2}, then SS is not constructible.

The bridge index of a tt-complicated knot is at least t+1t+1. So, if a knot is at least ⌊m3⌋\lfloor\frac{m}{3}\rfloor-complicated, its bridge index automatically exceeds m3\frac{m}{3}. Thus, Ehrenborg–Hachimori–Shimokawa’s theorem, the results of Hachimori and Ziegler in , the previous examples, and our present results blend into the following new hierarchy.

A 33-sphere with a non-trivial knot consisting of 33 edges, 11-complicated is not constructible, but can be LC. 33 edges, 22-complicated is not constructible, but can be LC. xxxxxxxx 33 edges, 33-complicated or more is not LC. 44 edges, 11-complicated is not vertex dec., but can be shellable. 44 edges, 22- or 33-complicated is not constructible, but can be LC. 44 edges, 44-complicated or more is not LC. 55 edges, 11-complicated is not vertex dec., but can be shellable. 55 edges, 22-, 33- or 44-complicated is not constructible, but can be LC. 55 edges, 55-complicated or more is not LC. 66 edges, 11-complicated can be vertex decomposable. 66 edges, 22-complicated is not vertex dec., but can be LC. 66 edges, 33-, 44 or 55-complicated is not constructible, but can be LC. 66 edges, 66-complicated or more is not LC. ⋮ ⋮ mm edges, kk-complicated, k≥⌊m3⌋k\geq\lfloor\frac{m}{3}\rfloor is not vertex decomposable. mm edges, kk-complicated, k≥⌊m2⌋k\geq\lfloor\frac{m}{2}\rfloor is not constructible. mm edges, kk-complicated, k≤m−1k\leq m-1 can be LC. mm edges, kk-complicated, k≥mk\geq m is not LC.

The same conclusions are valid for 33-balls that contain a knot, up to replacing the word “LC”, wherever it occurs, with the word “collapsible”. (See Lemma 2.25, Corollary 3.12 and .)

One may also derive from Zeeman’s theorem (“given any simplicial 33-ball, there is a positive integer rr so that its rr-th barycentric subdivision is collapsible” [48, Chapters I and III]) that any 33-sphere will become LC after sufficiently many barycentric subdivisions. On the other hand, there is no fixed number rr of subdivisions that is sufficient to make all 33-spheres LC. (For this use sufficiently complicated knots, together with Theorem 2.13.)

On LC Balls

The combinatorial topology of dd-balls and of dd-spheres are intimately related: Removing any facet Δ\Delta from a dd-sphere SS we obtain a dd-ball S−ΔS-\Delta, and adding a cone over the boundary of a dd-ball BB we obtain a dd-sphere SBS_{B}. We do have a combinatorial characterization of LC dd-balls, which we will reach in Theorem 3.10; it is a bit more complicated, but otherwise analogous to the characterization of LC dd-spheres as given in Main Theorem 1.

For simplicial dd-balls, we have the following hierarchy:

The first two inclusions are known. We have already seen that all constructible complexes are LC (Lemma 2.23). Every LC dd-ball is collapsible onto a (d−2)(d-2)-complex by Corollary 3.11.

Let us see next that all inclusions are strict for d=3d=3: For the first inclusion this follows from Lockeberg’s example of a 44-polytope whose boundary is not vertex decomposable. For the second inclusion, take Ziegler’s non-shellable ball from , which is constructible by construction. A non-constructible 33-ball that is LC will be provided by Theorem 3.16. A collapsible 33-ball that is not LC will be given in Theorem 3.23. Finally, Bing and Goodrick showed that not every 33-ball is collapsible .

To show that the inclusions are strict for all d≥3d\geq 3, we argue as follows. For the first four inclusions we get this from the case d=3d=3, since

the cone v∗Bv*B is vertex decomposable resp. shellable resp. constructible if and only if BB is,

and in Proposition 3.25 we will show that v∗Bv*B is LC if and only if BB is.

For the last inclusion and d≥3d\geq 3, we look at the dd-balls obtained by removing a facet from a non-LC dd-sphere. These exist by Corollary 2.21; they do not collapse onto a (d−2)(d-2)-complex by Theorem 2.10. ∎

We begin with a relative version of the notions of “facet-killing sequence” and “facet massacre”, which we introduced in Subsection 2.1.

Let PP a pure dd-complex. Let QQ be a proper subcomplex of PP, either pure dd-dimensional or empty. A facet-killing sequence of (P,Q)(P,Q) is a sequence P0,P1,…,Pt−1,PtP_{0},P_{1},\ldots,P_{t-1},P_{t} of simplicial complexes such that t=fd(P)−fd(Q)t=f_{d}(P)-f_{d}(Q), P0=PP_{0}=P, and Pi+1P_{i+1} is obtained by PiP_{i} removing a pair (σ,Σ)(\sigma,\Sigma) such that σ\sigma is a free (d−1)(d-1)-face of Σ\Sigma that does not lie in QQ (which also implies that Σ∉Q\Sigma\notin Q).

It is easy to see that PtP_{t} has the same dd-faces as QQ. The version of facet killing sequences given in Definition 2.3 is a special case of this one, namely the case when QQ is empty.

Let PP a pure dd-dimensional simplicial complex. Let QQ be either the empty complex, or a pure dd-dimensional proper subcomplex of PP. A pure facet-massacre of (P,Q)(P,Q) is a sequence P0,P1,…,Pt−1,PtP_{0},P_{1},\ldots,P_{t-1},P_{t} of (pure) complexes such that t=fd(P)−fd(Q)t=f_{d}(P)-f_{d}(Q), P0=PP_{0}=P, and Pi+1P_{i+1} is obtained by PiP_{i} removing:

a pair (σ,Σ)(\sigma,\Sigma) such that σ\sigma is a free (d−1)(d-1)-face of Σ\Sigma that does not lie in QQ, and

all inclusion-maximal faces of dimension smaller than dd that are left after the removal of type (a) or, recursively, after removals of type (b).

Necessarily Pt=QP_{t}=Q (and when Q=∅Q=\emptyset we recover the notion of facet-massacre of PP, that we introduced in Definition 2.5). It is easy to see that a step Pi⟶Pi+1P_{i}\longrightarrow P_{i+1} can be factorized (not in an unique way) in an elementary collapse followed by a removal of faces of dimensions smaller than dd that makes Pi+1P_{i+1} a pure complex. Thus, a single pure facet-massacre of (P,Q)(P,Q) corresponds to many facet-killing sequences of (P,Q)(P,Q).

We will apply both definitions to the pair (P,Q)=(KT,∂B)(P,Q)=(K^{T},\partial B), where KTK^{T} is defined for balls as follows.

If BB be a dd-ball with NN facets, and TT is a spanning tree of the dual graph of BB, define KTK^{T} as the subcomplex of BB formed by all (d−1)(d-1)-faces of BB that are not hit by TT.

KTK^{T} is a pure (d−1)(d-1)-dimensional simplicial complex, containing ∂B\partial B as a subcomplex;

KTK^{T} has D+b2D+\frac{b}{2} facets, where bb is the number of facets in ∂B\partial B, and D:=dN−N+22D:=\frac{dN-N+2}{2};

for any dd-simplex Δ\Delta of BB,     B−Δ  ↘KT\;\;B-\Delta\;\searrow K^{T};

KTK^{T} is homotopy equivalent to a (d−1)(d-1)-dimensional sphere.

We introduce another convenient piece of terminology.

Let BB be a simplicial dd-ball. A seepage is a (d−1)(d-1)-dimensional subcomplex CC of BB whose (d−1)(d-1)-faces are exactly given by the boundary of BB.

A seepage is not necessarily pure; actually there is only one pure seepage, namely ∂B\partial B itself. Since KTK^{T} contains ∂B\partial B, a collapse of KTK^{T} onto a seepage must remove all the (d−1)(d-1)-faces of KTK^{T} that are not in ∂B\partial B: This is what we called a facet-killing sequence of (KT,∂B)(K^{T},\partial B).

Let BB be a dd-ball, and Δ\Delta a dd-simplex of BB. Let CC be a seepage of ∂B\partial B. Then,

Analogous to the proof of Proposition 2.4. The crucial assumption is that no face of ∂B\partial B is removed in the collapse (since all boundary faces are still present in the final complex CC). ∎

If we fix a spanning tree TT of the dual graph of BB, we have then a 1-1 correspondence between the following sets:

the set of collapses B−Δ  ↘KTB-\Delta\;\searrow K^{T};

the set of “natural labelings” of TT, where Δ\Delta is labeled by 11;

the set of the first parts (T1,…,TN)(T_{1},\ldots,T_{N}) of local constructions for BB, with T1=ΔT_{1}=\Delta.

Let BB be a dd-ball; fix a facet Δ\Delta, and a spanning tree TT of the dual graph of BB, rooted at Δ\Delta. The second part of a local construction for BB along TT corresponds bijectively to a facet-massacre of (KT,∂B)(K^{T},\partial B).

Let us start with a local construction [T1,…,TN−1,]TN,…,Tk\left[T_{1},\ldots,T_{N-1},\right]T_{N},\ldots,T_{k} for BB along TT. Topologically, B=TN/∼B=T_{N}/{\sim}, where ∼{\sim} is the equivalence relation determined by the gluing, and KT=∂TN/∼K^{T}=\partial T_{N}/{\sim}.

KTK^{T} has D+b2D+\frac{b}{2} facets (see Lemma 3.5), and all of them, except the bb facets in the boundary, represent gluings. Thus we have to describe a sequence P0,…,PtP_{0},\ldots,P_{t} with t=D−b2t=D-\frac{b}{2}. But the local construction (T1,…,TN−1,)TN,…,Tk\left(T_{1},\ldots,T_{N-1},\right)T_{N},\ldots,T_{k} produces BB (which has bb facets in the boundary) from TNT_{N} (which has 2D2D facets in the boundary, cf. Lemma 4.1) in k−Nk-N steps, each removing a pair of facets from the boundary. So, 2D−2(k−N)=b2D-2(k-N)=b, which implies k−N=tk-N=t.

Define P0:=KT=∂TN/∼P_{0}:=K_{T}=\partial T_{N}/{\sim}, and Pj:=∂TN+j/∼P_{j}:=\partial T_{N+j}/{\sim}. In the first LC step, TN→TN+1T_{N}\rightarrow T_{N+1}, we remove from the boundary a free ridge rr, together with the unique pair σ′,σ′′\sigma^{\prime},\sigma^{\prime\prime} of facets of ∂TN\partial T_{N} sharing rr. At the same time, rr and the newly formed face σ\sigma are sunk into the interior; so obviously neither σ\sigma nor rr will appear in ∂B\partial B. This step ∂TN⟶∂TN+1\partial T_{N}\longrightarrow\partial T_{N+1} naturally induces an analogous step ∂TN+j/∼⟶∂TN+j+1/∼\partial T_{N+j}/{\sim}\longrightarrow\partial T_{N+j+1}/{\sim}, namely, the removal of rr and of the unique (d−1)−(d-1)-face σ\sigma containing it, with rr not in ∂B\partial B.

The rest is analogous to the proof of Theorem 2.8. ∎

Thus, BB can be locally constructed along a tree TT if and only if KTK^{T} collapses onto some seepage. What if we do not fix the tree TT or the facet Δ\Delta?

Let BB be a dd-ball; let σ\sigma be a (d−1)(d-1)-face in the boundary ∂B\partial B, and let Σ\Sigma be the unique facet of BB containing σ\sigma. Let CC be a subcomplex of BB. If CC contains ∂B\partial B, the following are equivalent:

Let BB be a dd-ball. Then the following are equivalent:

KTK^{T} collapses onto some seepage CC, for some spanning tree TT of the dual graph of BB;

there exists a seepage CC such that for every facet Δ\Delta of BB one has B−Δ  ↘CB-\Delta\;\searrow C;

B−Δ  ↘CB-\Delta\;\searrow C, for some facet Δ\Delta of BB, and for some seepage CC;

there exists a seepage CC such that for every facet σ\sigma of ∂B\partial B one has B  ↘  C−σB\;\searrow\;C-\sigma;

B  ↘  C−σB\;\searrow\;C-\sigma, for some facet σ\sigma of ∂B\partial B, and for some seepage CC;

The equivalences 1⇔2⇔3⇔41\Leftrightarrow 2\Leftrightarrow 3\Leftrightarrow 4 are established analogously to the proof of Theorem 2.10. Finally, Lemma 3.9 implies that 3⇒5⇒6⇒43\Rightarrow 5\Rightarrow 6\Rightarrow 4. ∎

Every LC dd-ball collapses onto a (d−2)(d-2)-complex.

By Theorem 3.10, the ball BB collapses onto the union of the boundary of BB minus a facet with some (d−2)(d-2)-complex. The boundary of BB minus a facet is a (d−1)(d-1)-ball; thus it can be collapsed down to dimension d−2d-2, and the additional (d−2)(d-2)-complex will not interfere. ∎

Let BB be a 33-ball. Then the following are equivalent:

KT↘∂BK^{T}\searrow\partial B, for some spanning tree TT of the dual graph of BB;

B−Δ  ↘∂BB-\Delta\;\searrow\partial B, for every facet Δ\Delta of BB;

B−Δ  ↘∂BB-\Delta\;\searrow\partial B, for some facet Δ\Delta of BB;

B  ↘  ∂B−σB\;\searrow\;\partial B-\sigma, for every facet σ\sigma of ∂B\partial B;

B  ↘  ∂B−σB\;\searrow\;\partial B-\sigma, for some facet σ\sigma of ∂B\partial B.

When BB has dimension 3, any seepage CC of ∂B\partial B is a 22-complex containing ∂B\partial B, plus some edges and vertices. If a complex homotopy equivalent to S2S^{2} collapses onto CC, then CC is also homotopy equivalent to S2S^{2}, thus CC can only be ∂B\partial B with some trees attached (see Figure 5), which implies that C↘∂BC\searrow\partial B. ∎

If BB is LC, it collapses to some 22-ball ∂B−σ\partial B-\sigma, but all 22-balls are collapsible. ∎

All constructible 33-balls are collapsible.

For example, Ziegler’s ball, Grünbaum’s ball, and Rudin’s ball are collapsible (see ).

The locally constructible 33-balls with NN facets are precisely the 33-balls that admit a “special collapse”, namely such that after the first elementary collapse, in the next N−1N-1 collapses, no triangle of ∂B\partial B is collapsed away. Such a collapse acts along a dual (directed) tree of the ball, whereas a generic collapse acts along an acyclic graph that might be disconnected.

One could argue that maybe “special collapses” are not that special: Perhaps every collapsible 33-ball has a collapse that removes only one boundary triangle in its top-dimensional phase? This is not so: We will produce a counterexample in the next subsection (Theorem 3.23).

For every d≥3d\geq 3, not all LC dd-balls are constructible.

If BB is a non-constructible dd-ball and vv is a new vertex, then v∗Bv*B is a non-constructible (d+1)(d+1)-ball. Also, it is easy to see that if BB is LC then v∗Bv\ast B is also LC (cf. Proposition 3.25). Therefore, it suffices to prove the claim for d=3d=3.

In Example 2.28 we described a 33-ball B13,55B_{13,55} that collapses onto its boundary minus a facet. By Corollary 3.12, B13,55B_{13,55} is LC. At the same time, B13,55B_{13,55} contains a 33-edge trefoil knot, which prevents B13,55B_{13,55} from being constructible [26, Thm. 1]. ∎

2 3-Balls without interior vertices.

Here we show that a simplicial 33-ball with all vertices on the boundary cannot contain any knotted spanning edge if it is LC, but might contain some if it is collapsible. We use this fact to establish our hierarchy for dd-balls (Theorem 3.1).

Let us fix some notation first. Recall that by Theorem 1.2, each connected component of the boundary of a simplicial LC 33-pseudomanifold is homeomorphic to a simply-connected union of 22-spheres, any two of which share at most one point. Let us call pinch points the points shared by two or more spheres in the boundary of an LC 33-pseudomanifold.

[Steps of types (i)-(ix) in LC constructions] Any admissible step in a local construction of a 33-pseudomanifold falls into one of the following nine types:

attaching a tetrahedron along a triangle;

identifying two boundary triangles that share exactly 1 edge;

identifying two boundary triangles that share 1 edge and the opposite vertex;

identifying two b. t. that share 2 edges that meet in a pinch point;

identifying two b. t. that share 2 edges that do not meet in a pinch point;

identifying two b. t. that share 3 edges, all of whose vertices are pinch points;

identifying two b. t. that share 3 edges, two of whose vertices are pinch points;

identifying two b. t. that share 3 edges, one of whose vertices is a pinch point;

identifying two b. t. that share 3 edges, none of whose vertices is a pinch point.

For example, the first N−1N-1 steps of any local construction of a 33-pseudomanifold with NN tetrahedra are all of type (i); the last step in the local construction of a 33-sphere is necessarily of type (ix).

The following table summarizes the distinguished effects of the steps:

where the asterisk recalls that a type (iii) step almost disconnects the boundary, pinching it in a point.

Now, let BB be an LC 33-ball without interior vertices. Steps of type (v), (vii), (viii) or (ix) sink respectively one, one, two and three vertices into the interior, so they cannot occur in the local construction of BB. Furthermore, any identification of type (vi) or (iv) increases the number of connected components in the boundary, hence it must be followed by at least one step of type (ix), which destroys a connected component of the boundary. Yet (ix) is forbidden, so no identification of type (vi) or (iv) can occur. Finally, the “pinching step” (iii) needs to be followed by one of the steps (vi), (vii), (viii) or (ix) in order to restore the ball topology – but such steps are forbidden. This leads us to the following Lemma:

Let BB be an LC 33-pseudomanifold. The following are equivalent:

in some local construction for BB all steps are of type (i) or (ii);

in every local construction for BB all steps are of type (i) or (ii);

BB is a 33-ball without interior vertices.

We will use Lemma 3.18 to obtain examples of non-LC 33-balls. We already know that non-collapsible balls are not LC, by Corollary 3.13: so a 33-ball with a knotted spanning edge cannot be LC if the knot is the sum of two or more trefoil knots. (See also Bing and Goodrick .) What about balls with a spanning edge realizing a single trefoil knot?

An LC 33-ball without interior vertices does not contain any knotted spanning edge.

An LC 33-ball BB without interior vertices is obtained from a tree of tetrahedra via local gluings of type (ii), by Lemma 3.18. A tree of tetrahedra has no interior edge. Each type (ii) step preserves the existing spanning edges (because it does not sink vertices into the interior), and creates one more spanning edge ee, clearly unknotted (because the other two edges of the sunk triangle form a boundary path that “closes up” the edge ee onto an S1S^{1} bounding a disc inside BB). It is easy to verify that the subsequent type (ii) steps leave such edge ee spanning and unknotted. ∎

The presence of knots/knotted spanning edges is not the only obstruction to local constructibility. Bing’s thickened house with two rooms is a 33-ball BB with all vertices on the boundary, so that every interior triangle of BB has at most one edge on the boundary ∂B\partial B. Were BB LC, every step in its local construction would be of type (ii) (by Lemma 3.18); in particular, the last triangle to be sunk into the interior of BB would have exactly two edges on the boundary of BB. Thus Bing’s thickened house with two rooms cannot be LC, even if it does not contain a knotted spanning edge.

Furch’s 33-ball [16, p. 73] [9, p. 110] can be triangulated without interior vertices (see e.g. ). Since it contains a knotted spanning edge, by Proposition 3.19 Furch’s ball is not LC.

In [22, Lemma 2], Hachimori claimed that any 33-ball CC obtained from a constructible 33-ball C′C^{\prime} via a type (ii) step is constructible. This would imply by Lemma 3.18 that all LC 33-balls without interior vertices are constructible, which is stronger than Proposition 3.19 since constructible 33-balls do not contain knotted spanning edges [26, Lemma 1]. Unfortunately, Hachimori’s proof [22, p. 227] is not satisfactory: If C′=C1′∪C2′C^{\prime}=C^{\prime}_{1}\cup C^{\prime}_{2} is a constructible decomposition of C′C^{\prime}, and CiC_{i} is the subcomplex of CC with the same facets of Ci′C^{\prime}_{i}, C=C1∪C2C=C_{1}\cup C_{2} need not be a constructible decomposition for CC. (For example, if the two glued triangles both lie on ∂C1′\partial C_{1}^{\prime}, and if the two vertices that the triangles do not have in common lie in C1′∩C2′C_{1}^{\prime}\cap C_{2}^{\prime}, then C1∩C2C_{1}\cap C_{2} is not a 22-ball and one of C1C_{1} and C2C_{2} is not a 33-ball.)

At present we do not know whether Hachimori’s claim is true: Does C′C^{\prime} admit a different constructible decomposition that survives the type (ii) step? On this depends the correctness of the algorithm [22, p. 227] [23, p. 101] to test constructibility of 33-balls without interior vertices by cutting them open along triangles with exactly two boundary edges. However, we point out that Hachimori’s algorithm can be validly used to decide the local constructibility of 33-balls without interior vertices: In fact, by Lemma 3.18, the algorithm proceeds by reversing the LC-construction of the ball.

We can now move on to complete the proof of our Theorem 3.1. Inspired by Proposition 3.19, we show that a collapsible 33-ball without interior vertices may contain a knotted spanning edge. Our construction is a tricky version of Lickorish–Martin’s (see Example 2.26).

Start with a large m×m×1m\times m\times 1 pile of cubes, triangulated in the standard way, and take away two distant cubes, leaving only their bottom squares XX and YY. The 33-complex CC obtained can be collapsed vertically onto its square basis; in particular, it is collapsible, and has no interior vertices.

Let C′C^{\prime} be a 33-ball with two tubular holes drilled away, but where (1) each hole has been corked at a bottom with a 22-disk, and (2) the tubes are disjoint but intertwined, so that a closed path that passes through both holes and between these traverses the top resp. bottom face of C′C^{\prime} yields a trefoil knot (see Figure 6).

CC and C′C^{\prime} are homeomorphic. Any homeomorphism induces on C′C^{\prime} a collapsible triangulation with no interior vertices. XX and YY correspond via the homeomorphism to the corking membranes of C′C^{\prime}, which we will call correspondingly X′X^{\prime} and Y′Y^{\prime}. To get from C′C^{\prime} to a ball with a knotted spanning edge we will carry out two more steps:

create a single edge [x′,y′][x^{\prime},y^{\prime}] that goes from X′X^{\prime} to Y′Y^{\prime};

thicken the “bottom” of C′C^{\prime} a bit, so that C′C^{\prime} becomes a 33-ball and [x′,y′][x^{\prime},y^{\prime}] becomes an interior edge (even if its extremes are still on the boundary).

We perform both steps by adding cones over 22-disks to the complex. Such steps preserve collapsibility, but in general they produce interior vertices; thus we choose “specific” disks with few interior vertices.

Provided mm is large enough, one finds a “nice” strip F1,F2,…,FkF_{1},F_{2},\dots,F_{k} of triangles on the bottom of C′C^{\prime}, such that F1∪F2∪⋯∪FkF_{1}\cup F_{2}\cup\dots\cup F_{k} is a disk without interior vertices, F1F_{1} has a single vertex x′x^{\prime} in the boundary of X′X^{\prime}, while FkF_{k} has a single vertex y′y^{\prime} in the boundary of Y′Y^{\prime}, and the whole strip intersects X′∪Y′X^{\prime}\cup Y^{\prime} only in x′x^{\prime} and y′y^{\prime}. Then we add a cone to C′C^{\prime}, setting

(An explicit construction of this type is carried out in [26, pp. 164-165].) Thus one obtains a collapsible 33-complex C1C_{1} with no interior vertex, and with a direct edge from X′X^{\prime} to Y′Y^{\prime}.

Let RR be a 22-ball inside the boundary of C1C_{1} that contains in its interior the 22-complex X′∪Y′∪[x′,y′]X^{\prime}\cup Y^{\prime}\cup[x^{\prime},y^{\prime}], and such that every interior vertex of RR lies either in X′X^{\prime} or in Y′Y^{\prime}. Take a new point z′z^{\prime} and define C2 := C1∪(z′∗R)C_{2}\ :=\ C_{1}\cup(z^{\prime}*R).

As z′∗Rz^{\prime}*R collapses onto RR, it is easy to verify that C2C_{2} is a collapsible 33-ball with a knotted spanning edge [x′,y′][x^{\prime},y^{\prime}]. By Proposition 3.19, C2C_{2} is not LC. ∎

There exists a collapsible 33-ball BB such that for any boundary facet σ\sigma, the ball BB does not collapse onto ∂B−σ\partial B-\sigma.

Theorem 3.23 can be extended to higher dimensions by taking cones. In fact, even though the link of an LC complex need not be LC, the link of an LC closed star is indeed LC.

Let CC be a dd-pseudomanifold and vv a new point. CC is LC if and only if v∗Cv*C is LC.

The implication “if CC is LC, then v∗Cv*C is LC” is straightforward.

For the converse, assume TiT_{i} and Ti+1T_{i+1} are intermediate steps in the local construction of v∗Cv*C, so that passing from TiT_{i} to Ti+1T_{i+1} we glue together two adjacent dd-faces σ′,σ′′\sigma^{\prime},\sigma^{\prime\prime} of ∂Ti\partial T_{i}. Let FF be any (d−1)(d-1)-face of TiT_{i}. If FF does not contain vv, then FF is in the boundary of v∗Cv*C, so F∈∂Ti+1F\in\partial T_{i+1}. Therefore, FF cannot belong to the intersection of σ′\sigma^{\prime} and σ′′\sigma^{\prime\prime}, which is sunk into the interior of Ti+1T_{i+1}.

So, every (d−1)(d-1)-face in the intersection σ′∩σ′′\sigma^{\prime}\cap\sigma^{\prime\prime} must contain the vertex vv. This implies that σ′=v∗S′\sigma^{\prime}=v*S^{\prime} and σ′′=v∗S′′\sigma^{\prime\prime}=v*S^{\prime\prime}, with S′S^{\prime} and S′′S^{\prime\prime} distinct (d−1)(d-1)-faces. S′S^{\prime} and S′′S^{\prime\prime} must share some (d−2)(d-2)-face, otherwise σ′\sigma^{\prime} and σ′\sigma^{\prime} would not be adjacent. So from a local construction of v∗Cv*C we can read off a local construction of CC. ∎

For every d≥3d\geq 3, not all collapsible dd-balls are LC.

All cones are collapsible. If BB is a non-LC dd-ball, then v∗Bv\ast B is a non-LC (d+1)(d+1)-ball by Proposition 3.25. ∎

We conclude this chapter observing that Chillingworth’s theorem, “every geometric triangulation of a convex 33-dimensional polytope is collapsible”, can be strengthened as follows.

The argument of Chillingworth for collapsibility runs showing that B↘  ∂B−σB\searrow\;\partial B-\sigma, where σ\sigma is any triangle in the boundary of BB. Now Theorem 3.12 ends the proof. ∎

Thus any subdivided 33-simplex is LC. If Hachimori’s claim is true (see Remark 3.22), then any subdivided 33-simplex with all vertices on the boundary is also constructible. (So far we can only exclude the presence of knotted spanning edges in it: See Lemma 3.18.) However, a subdivided 33-simplex might be non-shellable even if it has all vertices on the boundary (Rudin’s ball is an example).

Upper bounds on the number of LC d𝑑d-spheres.

For fixed d≥2d\geq 2 and a suitable constant CC that depends on dd, there are less than CNC^{N} combinatorial types of LC dd-spheres with NN facets. Our proof for this fact is a dd-dimensional version of the main theorem of Durhuus & Jonsson , and allows us to determine an explicit constant CC, for any dd. It consists of two different phases:

we observe that there are less trees of dd-simplices than planted plane dd-ary trees, which are counted by order dd Fuss–Catalan numbers;

we count the number of “LC matchings” according to ridges in the tree of simplices.

We will here establish that there are less than Cd(N):=1(d−1)N+1(dNN)C_{d}(N):=\frac{1}{(d-1)N+1}\binom{dN}{N} trees of NN dd-simplices.

Every tree of NN dd-simplices has (d−1)N+2(d-1)N+2 boundary facets of dimension d−1d-1 and N−1N-1 interior faces of dimension d−1d-1. It has d2((d−1)N+2)\frac{d}{2}((d-1)N+2) faces of dimension d−2d-2, all of them lying in the boundary.

By rooted tree of simplices we mean a tree of simplices BB together with a distinguished facet δ\delta of ∂B\partial B, whose vertices have been labeled 1,2,…,d1,2,\dots,d. Rooted trees of dd-simplices are in bijection with “planted plane dd-ary trees”, that is, plane rooted trees such that every non-leaf vertex has exactly dd (left-to-right-ordered) sons; cf. .

There is a bijection between rooted trees of NN dd-simplices and planted plane dd-ary trees with NN non-leaf vertices, which in turn are counted by the Fuss–Catalan numbers Cd(N)=1(d−1)N+1 (dNN)C_{d}(N)=\frac{1}{(d-1)N+1}\,\binom{dN}{N}. Thus, the number of combinatorially-distinct trees of NN dd-simplices satisfies

Given a rooted tree of dd-simplices with a distinguished facet δ\delta in its boundary, there is a unique extension of the labeling of the vertices of δ\delta to a labeling of all the vertices by labels 1,2,…,d+11,2,\dots,d+1, such that no two adjacent vertices get the same label. Thus each dd-simplex receives all d+1d+1 labels exactly once.

Now, label each (d−1)(d-1)-face by the unique label that none of its vertices has. With this we get an edge-labeled rooted dd-ary tree whose non-leaf vertices correspond to the NN dd-simplices; the root corresponds to the dd-simplex that contains δ\delta, and the labeled edges correspond to all the (d−1)(d-1)-faces other than δ\delta. We get a plane tree by ordering the down-edges at each non-leaf vertex left to right according to the label of the corresponding (d−1)(d-1)-face.

The whole process is easily reversed, so that we can get a rooted tree of dd-simplices from an arbitrary planted plane dd-ary tree.

There are exactly Cd(N)=1(d−1)N+1 (dNN)C_{d}(N)=\frac{1}{(d-1)N+1}\,\binom{dN}{N} planted plane dd-ary trees with NN interior vertices (see e.g. Aval ; the integers C2(N)C_{2}(N) are the “Catalan numbers”, which appear in many combinatorial problems, see e.g. Stanley [44, Ex. 6.19]). Any tree of NN dd-simplices has exactly (d−1)N+2(d-1)N+2 boundary facets, so it can be rooted in exactly ((d−1)N+2)d!\left((d-1)N+2\right)d! ways, which however need not be inequivalent. This explains the first inequality claimed in the lemma. Finally, combinatorially-inequivalent trees of dd-simplices also yield inequivalent rooted trees, whence the second inequality follows. ∎

The number of trees of NN dd-simplices, for NN large, is bounded by

2 Counting the matchings in the boundary.

We know from the previous section that there are exponentially many trees of NN dd-simplices. Our goal is to find an exponential upper bound for the LC spheres obtainable by a matching of adjacent facets in the boundary of one fixed tree of simplices.

Fix d≥2d\geq 2. The number of combinatorially distinct LC dd-spheres (or LC dd-balls) with NN facets, for NN large, is not larger than

Let us fix a tree of NN dd-simplices BB. We adopt the word “couple” to denote a pair of facets in the boundary of BB that are glued to one another during the local construction of SS.

Let us set D:=12(2+N(d−1))D:=\frac{1}{2}(2+N(d-1)), which is an integer. By Lemma 4.1, the boundary of the tree of NN dd-simplices contains 2D2D facets, so each perfect matching is just a set of DD pairwise disjoint couples. We are going to partition every perfect matching into “rounds”. The first round will contain couples that are adjacent in the boundary of the tree of simplices. Recursively, the (i+1)(i+1)-th round will consist of all pairs of facets that become adjacent only after a pair of facets are glued together in the ii-th round.

Selecting a pair of adjacent facets is the same as choosing the ridge between them; and by Lemma 4.1, the boundary contains dDdD ridges. Thus the first round of identifications consists in choosing n1n_{1} ridges out of dDdD, where n1n_{1} is some positive integer. After each identification, at most d−1d-1 new ridges are created; so, after this first round of identifications, there are at most (d−1)n1(d-1)n_{1} new pairs of adjacent facets.

In the second round, we identify 2n22n_{2} of these newly adjacent facets: as before, it is a matter of choosing n2n_{2} ridges, out of the at most (d−1)n1(d-1)n_{1} just created ones. Once this is done, at most (d−1)n2(d-1)n_{2} ridges are created. And so on.

We proceed this way until all the 2 D2\,D facets in the boundary of BB have been matched (after ff steps, say). Clearly n1+…+nf=Dn_{1}+\ldots+n_{f}=D, and since the nin_{i}’s are positive integers, f≤Df\leq D must hold. This means there are at most

possible perfect matchings of (d−1)(d-1)-simplices in the boundary of a tree of NN dd-simplices.

We sharpen this bound by observing that not all ridges may be chosen in the first round of identifications. For example, we should exclude those ridges that belong to just two dd-simplices of BB. An easy double-counting argument reveals that in a tree of dd-simplices, the number of ridges belonging to at least 3 dd-simplices is less than or equal to N3  (d+12)\frac{N}{3}\;\binom{d+1}{2}. So in the upper bound above we may replace the first factor (dDn1)\binom{dD}{n_{1}} with the smaller factor (N3  (d+12)n1)\binom{\frac{N}{3}\;\binom{d+1}{2}}{n_{1}}.

To bound the sum from above, we use (nk)≤2n\binom{n}{k}\leq 2^{n} and n1+⋯+nf−1<n1+⋯+nf=Dn_{1}+\cdots+n_{f-1}<n_{1}+\cdots+n_{f}=D, while ignoring the conditions ni+1≤(d−1)nin_{i+1}\leq(d-1)n_{i}. Thus we obtain the upper bound

The factor 2d−12^{d-1} is asymptotically negligible. Thus the number of ways to fold a tree of NN dd-simplices into a sphere via a local construction sequence is smaller than 2  2d2−d3  N2^{\;\frac{2d^{2}-d}{3}\;N}. Combining this with Proposition 4.2, we conclude the proof for the case of dd-spheres. We leave the adaption of the proof for dd-balls (or general LC dd-pseudomanifolds) to the reader. ∎

The upper bound of Theorem 4.4 can be simplified in many ways. For example, for d≥16d\geq 16 it is smaller than 4d2N\sqrt{4}^{d^{2}N}. From Theorem 4.4 we obtain explicit upper bounds:

there are less than 216N216^{N} LC 33-spheres with NN facets,

there are less than 6117N6117^{N} LC 44-spheres with NN facets,

and so on. We point out that these upper bounds are not sharp, as we overcounted both on the combinatorial side and on the algebraic side. When d=2d=2, Tutte’s upper bound is asymptotically 3.08N3.08^{N}, whereas the one given by our formula is 16N16^{N}. When d=3d=3, however, our constant is smaller than what follows from Durhuus–Jonsson’s original argument:

we improved the matchings-bound from 384N384^{N} to 32N32^{N};

for the count of trees of tetrahedra we obtain an essentially sharp bound of 6.75N6.75^{N}. (The value implicit in the Durhuus–Jonsson argument [14, p. 184] is larger since one has to take into account that different trees of tetrahedra can have the same unlabeled dual graph.)

For any fixed d≥2d\geq 2, there are exponential lower and upper bounds for the number of LC dd-spheres on NN facets.

We have just obtained an upper bound; we also get a lower bound from Proposition 4.2/Corollary 4.3, since the boundary of a tree of (d+1)(d+1)-simplices is a stacked dd-sphere, and for d≥2d\geq 2 the stacked dd-sphere determines the tree of (d+1)(d+1)-simplices uniquely. ∎

We know very little about the number of LC dd-spheres with NN facets when dd is not constant and NN is relatively small (say, bounded by a polynomial) in terms of dd — and whether the LC condition is crucial for that. Compare Kalai .

Acknowledgement. We are very grateful to Matthias Staudacher, Davide Gabrielli, Niko Witte, Raman Sanyal, Thilo Rörig, Frank Lutz, Gil Kalai, and Emo Welzl for useful discussions and references. Many thanks also to the anonymous referees for the very careful reviews.

References