arXiv Analytics

Sign in

arXiv:2206.15461 [math.CO]AbstractReferencesReviewsResources

Subword Complexes and Kalai's Conjecture on Reconstruction of Spheres

Cesar Ceballos, Joseph Doolittle

Published 2022-06-30Version 1

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 in 1987, 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 in 2009. 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.

Related articles: Most relevant | Search more
arXiv:1611.01609 [math.CO] (Published 2016-11-05)
Reconstruction of graphs via asymmetry
arXiv:math/0607142 [math.CO] (Published 2006-07-05)
Eigenvectors and Reconstruction
arXiv:1710.00118 [math.CO] (Published 2017-09-29)
Graphs, Skeleta and Reconstruction of Polytopes