Search arXivSearch

arXiv · 2208.06693

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

Abstract

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: for any $1\leq i\leq (d-1)/2$, the space of affine $i$-stresses of a simplicial $d$-polytope as well as the space of affine $i$-stresses of a simplicial $(d-1)$-sphere (with a generic embedding) can be expressed as the sum of affine $i$-stress spaces of vertex stars. This is analogous to Adiprasito's partition of unity of linear stresses for Cohen--Macaulay complexes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isabella Novik, Hailun Zheng. 2024-03-22. Affine stresses: the partition of unity and Kalai's reconstruction conjectures. https://arxiv.org/abs/2208.06693

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO