Subword Complexes and Kalai's Conjecture on Reconstruction of Spheres.
Saved in:
| Title: | Subword Complexes and Kalai's Conjecture on Reconstruction of Spheres. |
|---|---|
| Authors: | Ceballos, Cesar1 (AUTHOR) cesar.ceballos@tugraz.at, Doolittle, Joseph1 (AUTHOR) nerdyjoe@gmail.com |
| Source: | Discrete & Computational Geometry. Jul2025, Vol. 74 Issue 1, p23-48. 26p. |
| Subjects: | Coxeter groups, Projective planes, Homology theory, Reconstruction (Graph theory), Torus |
| Abstract: | A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani (Aequationes Math 34(2–3):287–297, 1987, https://doi.org/10.1007/BF01830678), via a non-constructive proof using topological tools from homology theory. An elegant constructive proof was given by Kalai shortly after. In their original paper, Blind and Mani asked whether their result can be extended to simplicial spheres, and a positive answer to their question was conjectured by Kalai (2009, https://gilkalai.wordpress.com/2009/01/16/telling-a-simple-polytope-from-its-graph/). In this paper, we show that Kalai's conjecture holds in the particular case of Knutson and Miller's spherical subword complexes. This family of simplicial spheres arises in the context of Coxeter groups, and is conjectured to be polytopal. In contrast, not all manifolds are reconstructible. We show two explicit examples, namely the torus and the projective plane. [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani (Aequationes Math 34(2–3):287–297, 1987, https://doi.org/10.1007/BF01830678), via a non-constructive proof using topological tools from homology theory. An elegant constructive proof was given by Kalai shortly after. In their original paper, Blind and Mani asked whether their result can be extended to simplicial spheres, and a positive answer to their question was conjectured by Kalai (2009, https://gilkalai.wordpress.com/2009/01/16/telling-a-simple-polytope-from-its-graph/). In this paper, we show that Kalai's conjecture holds in the particular case of Knutson and Miller's spherical subword complexes. This family of simplicial spheres arises in the context of Coxeter groups, and is conjectured to be polytopal. In contrast, not all manifolds are reconstructible. We show two explicit examples, namely the torus and the projective plane. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 01795376 |
| DOI: | 10.1007/s00454-025-00733-6 |
