Reconstructing simplicial polytopes from their graphs and affine 22-stresses

preprint2022arXivOpen access

Abstract

A conjecture of Kalai from 1994 posits that for an arbitrary 2≤k≤⌊d/2⌋2\leq k\leq \lfloor d/2 \rfloor, the combinatorial type of a simplicial dd-polytope PP is uniquely determined by the (k−1)(k-1)-skeleton of PP (given as an abstract simplicial complex) together with the space of affine kk-stresses on PP. We establish the first non-trivial case of this conjecture, namely, the case of k=2k=2. We also prove that for a general kk, Kalai's conjecture holds for the class of kk-neighborly polytopes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.