Nonconstructible simplicial balls and a way of testing constructibility (Q1302038)

Triangulations of 3-dimensional topological balls can be classified according to the hierarchy given by the sequence ``vertex-decomposable implies shellable implies constructible''. There is a great variety of examples and constructions of non-shellable 3-balls [cf. the reviewer's survey in Discrete Comput. Geom. 19, No. 2, 159-174 (1998; Zbl 0898.52006)]. In this paper Hachimori shows that some, but not all, of the known examples of non-shellable 3-balls are not constructible. Some non-shellable examples have all their vertices on the boundary. For balls that satisfy this condition he produces a fast (linear-time in the number of facets) algorithm to check constructibility. Hachimori's investigation in this paper was followed and extended by joint work with the reviewer [Math. Z., to appear] and with \textit{R.~Ehrenborg} [preprint (1999), 12 pages].