English

Rigidity of Balanced Minimal Cycle Complexes

Combinatorics 2023-10-10 v1

Abstract

A (d1)(d-1)-dimensional simplicial complex Δ\Delta is balanced if its graph G(Δ)G(\Delta) is dd-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal (d1)(d-1)-pseudomanifolds Δ\Delta with d3d\geq3 by showing that the subgraph of G(Δ)G(\Delta) induced by the vertices colored in TT is rigid in R3\mathbb{R}^3 for any 33 colors TT. We show that the same rigidity result, and thus the balanced lower bound theorem, holds for balanced minimal (d1)(d-1)-cycle complexes with d3d \geq 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\bm{a}-balanced, simplicial complexes. Among other results, we show that for d4d \geq 4, a balanced homology (d1)(d-1)-manifold can be realized as an infinitesimally rigid framework in Rd\mathbb{R}^d such that each vertex of color ii lies on the iith coordinate axis.

Keywords

Cite

@article{arxiv.2310.05005,
  title  = {Rigidity of Balanced Minimal Cycle Complexes},
  author = {Ryoshun Oba},
  journal= {arXiv preprint arXiv:2310.05005},
  year   = {2023}
}

Comments

16 pages

R2 v1 2026-06-28T12:43:40.657Z