Zero Forcing, Support Varieties, and Boundary Complexes
Abstract
Let a finite simple graph be given. We study symmetric matrices with this graph pattern that admit a null vector with prescribed exact support. Such a vector exists precisely when its support is a fort, meaning that no vertex outside the support has exactly one neighbor inside it. Over the complex numbers, we prove that the Zariski closure of each exact-support coefficient locus is irreducible and compute its codimension in terms of boundary vertices and a labeled forest on the connected components of the support. The corresponding forest deficiency also determines the generic restricted nullity. An incidence parametrization yields a prime decomposition of the reduced zero-forcing failure locus. For a prescribed common kernel, we describe the coefficient space through equilibrium stresses, exterior affine dependencies, and free coefficients. We then construct boundary complexes recording local solution values and equation residuals. Their gluing maps are defined over the universal coefficient ring and commute with arbitrary base change. By retaining the complete collection of support signatures associated with each seed set, we obtain a composition formula for the minimum zero-forcing number and an algorithm for its computation.
Related
- Fort Abundance in Zero Forcing
- Maximizing the discrepancy between zero forcing parameters relative to graph order
- A correction to the Zero Forcing Number of the Generalized Petersen Graphs P(n,3)
- Sharp zero forcing numbers for the generalized Petersen graphs P(n,3) and P(n,4)
- The forbidden structure for zero forcing number
BibTeX
@misc{han2026zero,
title = {{Zero Forcing, Support Varieties, and Boundary Complexes}},
author = {Zongjian Han and Yiran Liang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.31109},
eprint = {2610.31109},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.31109},
}
RIS
TY - UNPB
TI - Zero Forcing, Support Varieties, and Boundary Complexes
AU - Zongjian Han
AU - Yiran Liang
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.31109
UR - https://arxiv.org/abs/2610.31109
AB - Let a finite simple graph be given. We study symmetric matrices with this graph pattern that admit a null vector with prescribed exact support. Such a vector exists precisely when its support is a fort, meaning that no vertex outside the support has exactly one neighbor inside it. Over the complex numbers, we prove that the Zariski closure of each exact-support coefficient locus is irreducible and compute its codimension in terms of boundary vertices and a labeled forest on the connected components of the support. The corresponding forest deficiency also determines the generic restricted nullity. An incidence parametrization yields a prime decomposition of the reduced zero-forcing failure locus. For a prescribed common kernel, we describe the coefficient space through equilibrium stresses, exterior affine dependencies, and free coefficients. We then construct boundary complexes recording local solution values and equation residuals. Their gluing maps are defined over the universal coefficient ring and commute with arbitrary base change. By retaining the complete collection of support signatures associated with each seed set, we obtain a composition formula for the minimum zero-forcing number and an algorithm for its computation.
ER -