Affine stresses: the partition of unity and Kalai's reconstruction conjectures

arxiv(2022)

引用 0|浏览0
暂无评分
摘要
Kalai conjectured that if $P$ is a simplicial $d$-polytope that has no missing faces of dimension $d-1$, then the graph of $P$ and the space of affine $2$-stresses of $P$ determine $P$ up to affine equivalence. We propose a higher-dimensional generalization of this conjecture: if $2\leq i\leq d/2$ and $P$ is a simplicial $d$-polytope that has no missing faces of dimension $\geq d-i+1$, then the space of affine $i$-stresses of $P$ determines the space of affine $1$-stresses of $P$. We prove this conjecture for (1) $k$-stacked $d$-polytopes with $2\leq i\leq k\leq d/2-1$, (2) $d$-polytopes that have no missing faces of dimension $\geq d-2i+2$, and (3) flag PL $(d-1)$-spheres with generic embeddings (for all $2\leq i\leq d/2$). We also discuss several related results and conjectures. For instance, we show that if $P$ is a simplicial $d$-polytope that has no missing faces of dimension $\geq d-2i+2$, then the $(i-1)$-skeleton of $P$ and the set of sign vectors of affine $i$-stresses of $P$ determine the combinatorial type of $P$. Along the way, we establish the partition of unity of affine stresses: the spaces of affine stresses of any PL sphere (with a generic embedding) and the space of affine $1$-stresses of any strongly connected complex (with a mildly generic embedding) can be expressed as the sums of affine stress spaces of vertex stars. This is analogous to Adiprasito's partition of unity of linear stresses for Cohen-Macaulay complexes.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要