Rigidity of Balanced Minimal Cycle Complexes
Abstract
A (d-1)-dimensional simplicial complex is balanced if its graph G() is d-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal (d-1)-pseudomanifolds with d≥3 by showing that the subgraph of G() induced by the vertices colored in T is rigid in R3 for any 3 colors T. We show that the same rigidity result, and thus the balanced lower bound theorem, holds for balanced minimal (d-1)-cycle complexes with d ≥ 3. Motivated by the Stanley's work on a colored system of parameters for the Stanley-Reisner ring of balanced simplicial complexes, we further investigate the infinitesimal rigidity of non-generic realization of balanced, and more broadly a-balanced, simplicial complexes. Among other results, we show that for d ≥ 4, a balanced homology (d-1)-manifold can be realized as an infinitesimally rigid framework in Rd such that each vertex of color i lies on the ith coordinate axis.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.