Abstract
Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep information about the structure of the complex. It is natural to ask whether shellings may be efficiently found computationally. In a recent paper, Goaoc, Paták, Patáková, Tancer, and Wagner gave a negative answer to this question (assuming \(\mathsf {P}\ne \mathsf {NP}\)), showing that the problem of deciding whether a simplicial complex is shellable is \(\mathsf {NP}\)-complete. In this paper, we give simplified constructions of various gadgets used in the \(\mathsf {NP}\)-completeness proof of these authors. Using these gadgets combined with relative shellability and other ideas, we also exhibit a simpler proof of the \(\mathsf {NP}\)-completeness of the shellability decision problem. Our method systematically uses relative shellings to build up large shellable complexes with desired properties.
Similar content being viewed by others
Data availability
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
References
Adiprasito, K.A., Benedetti, B.: Subdivisions, shellability, and collapsibility of products. Combinatorica 37(1), 1–30 (2017)
Adiprasito, K.A., Benedetti, B., Lutz, F.H.: Extremal examples of collapsible complexes and random discrete Morse theory. Discrete Comput. Geom. 57(4), 824–853 (2017)
Adiprasito, K.A., Sanyal, R.: Relative Stanley–Reisner theory and upper bound theorems for Minkowski sums. Publ. Math. Inst. Hautes Études Sci. 124, 99–163 (2016)
Bing, R.H.: The Geometric Topology of 3-Manifolds. American Mathematical Society Colloquium Publications, vol. 40. American Mathematical Society, Providence (1983)
Björner, A.: Topological methods. In: Handbook of Combinatorics, vol. 2, pp. 1819–1872. Elsevier, Amsterdam (1995)
Björner, A., Lutz, F.H.: Simplicial manifolds, bistellar flips and a \(16\)-vertex triangulation of the Poincaré homology \(3\)-sphere. Exp. Math. 9(2), 275–289 (2000)
Björner, A., Wachs, M.L.: Shellable nonpure complexes and posets. I. Trans. Am. Math. Soc. 348(4), 1299–1327 (1996)
Björner, A., Wachs, M.L.: Shellable nonpure complexes and posets. II. Trans. Am. Math. Soc. 349(10), 3945–3975 (1997)
Chari, M.K.: Two decompositions in topological combinatorics with applications to matroid complexes. Trans. Am. Math. Soc. 349(10), 3925–3943 (1997)
Codenotti, G., Katthän, L., Sanyal, R.: On \(f\)- and \(h\)-vectors of relative simplicial complexes. Algebr. Comb. 2(3), 343–353 (2019)
Danaraj, G., Klee, V.: Which spheres are shellable? Ann. Discrete Math. 2, 33–52 (1978)
Danaraj, G., Klee, V.: A representation of \(2\)-dimensional pseudomanifolds and its use in the design of a linear-time shelling algorithm. Ann. Discrete Math. 2, 53–63 (1978)
Goaoc, X., Paták, P., Patáková, Z., Tancer, M., Wagner, U.: Shellability is NP-complete. In: 34th International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics, vol. 99, # 41. Leibniz-Zent. Inform., Wadern (2018)
Goaoc, X., Paták, P., Patáková, Z., Tancer, M., Wagner, U.: Shellability is NP-complete. J. ACM 66(3), # 21 (2019)
Hachimori, M.: Combinatorics of Constructible Complexes. PhD thesis, University of Tokyo (2000)
Hachimori, M.: Decompositions of two-dimensional simplicial complexes. Discrete Math. 308(11), 2307–2312 (2008)
Herzog, J., Hibi, T.: Monomial Ideals. Graduate Texts in Mathematics, vol. 260. Springer, London (2011)
Hochster, M.: Rings of invariants of tori, Cohen–Macaulay rings generated by monomials, and polytopes. Ann. Math. 96(2), 318–337 (1972)
Kaibel, V., Pfetsch, M.E.: Some algorithmic problems in polytope theory. In: Algebra. Geometry, and Software Systems, pp. 23–47. Springer, Berlin (2003)
Kuperberg, G.: Knottedness is in NP, modulo GRH. Adv. Math. 256, 493–506 (2014)
Lackenby, M: The efficient certification of knottedness and Thurston norm (2016). arXiv:1604.00290
Lutz, F.H.: Triangulated Manifolds with Few Vertices and Vertex-Transitive Group Actions. Berichte aus der Mathematik. Verlag Shaker, Aachen (1999)
Malgouyres, R., Francés, A.R.: Determining whether a simplicial 3-complex collapses to a \(1\)-complex is NP-complete. In: Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, vol. 4992, pp. 177–188. Springer, Berlin (2008)
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)
Pachner, U.: Konstruktionsmethoden und das kombinatorische Homöomorphieproblem für Triangulationen kompakter semilinearer Mannigfaltigkeiten. Abh. Math. Sem. Univ. Hamburg 57, 69–86 (1987)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Reisner, G.A.: Cohen–Macaulay quotients of polynomial rings. Adv. Math. 21(1), 30–49 (1976)
Shareshian, J.: On the shellability of the order complex of the subgroup lattice of a finite group. Trans. Am. Math. Soc. 353(7), 2689–2703 (2001)
Simon, R.S.: Combinatorial properties of “cleanness”. J. Algebra 167(2), 361–388 (1994)
Stanley, R.P.: Cohen–Macaulay rings and constructible polytopes. Bull. Am. Math. Soc. 81, 133–135 (1975)
Stanley, R.P.: Combinatorics and Commutative Algebra. Progress in Mathematics, vol. 41. Birkhäuser, Boston (1996)
Stanley, R.P.: Flag-symmetric and locally rank-symmetric partially ordered sets. Electron. J. Comb. 3(2), # R6 (1996)
Tancer, M.: Recognition of collapsible complexes is NP-complete. Discrete Comput. Geom. 55(1), 21–38 (2016)
Villarreal, R.H.: Monomial Algebras. Monographs and Research Notes in Mathematics. CRC Press, Boca Raton (2015)
Wachs, M.L.: Obstructions to shellability. Discrete Comput. Geom. 22(1), 95–103 (1999)
Wachs, M.L.: Poset topology: tools and applications. In: Geometric Combinatorics. IAS/Park City Mathematics Series, vol. 13, pp. 497–615. American Mathematical Society, Providence (2007)
White, J.A.: The Hopf monoid of megagreedoids (2018). arXiv:1802.04386
Acknowledgements
We thank an anonymous referee for careful and thoughtful comments, which helped us improve readability. We also thank Abhishek Rathod for his helpful feedback on a draft of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is supported in part by the Slovenian Research Agency (research program P1-0285 and research projects J1-9108, N1-0160, and J1-2451)
Rights and permissions
About this article
Cite this article
Santamaría-Galvis, A., Woodroofe, R. Shellings from Relative Shellings, with an Application to NP-Completeness. Discrete Comput Geom 66, 792–807 (2021). https://doi.org/10.1007/s00454-020-00273-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-020-00273-1