Boolean Rank Nine for Polygons with 35 to 40 Vertices
Abstract
We give a computer-assisted proof that the rectangle covering number, or Boolean rank, of every polygon slack matrix of order 35 through 40 is nine. The upper bound is due to Goucha, Gouveia, and Silva; the new contribution is the matching lower bound. A hypothetical covering by eight rectangles yields a saturated inclusion cycle between two antichains on eight coordinates. An exact maximal-chain identity bounds its length and assigns a nonnegative penalty to each inclusion edge. The equality case is excluded combinatorially, leaving at most 39 lower vertices. For orders 35 through 39, symmetry reductions and a shadow bound leave fifteen finite exclusions, each supported by a checked reverse-unit-propagation refutation. The main text presents the mathematical reductions and their dependencies; the accompanying supplement gives the complete cycle parameters, encodings, and certificate record. The previously known equality for orders 41 through 55 is cited directly.
Related
- Quantitative Chollet Inequalities for Matrices of Rank at Most Four: Spectral bounds and an order-nine tight-frame construction
- Isoperimetric Problems on cyclic polygons
- Triangulated polygons and Y-frieze patterns
- A Pick-type theorem for halfway-lattice polygons
- Large induced subgraphs with k vertices of maximum degree
BibTeX
@misc{zhu2026boolean,
title = {{Boolean Rank Nine for Polygons with 35 to 40 Vertices}},
author = {Dake Zhu},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.01674},
eprint = {2611.01674},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.01674},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Boolean Rank Nine for Polygons with 35 to 40 Vertices
AU - Dake Zhu
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.01674
UR - https://arxiv.org/abs/2611.01674
AB - We give a computer-assisted proof that the rectangle covering number, or Boolean rank, of every polygon slack matrix of order 35 through 40 is nine. The upper bound is due to Goucha, Gouveia, and Silva; the new contribution is the matching lower bound. A hypothetical covering by eight rectangles yields a saturated inclusion cycle between two antichains on eight coordinates. An exact maximal-chain identity bounds its length and assigns a nonnegative penalty to each inclusion edge. The equality case is excluded combinatorially, leaving at most 39 lower vertices. For orders 35 through 39, symmetry reductions and a shadow bound leave fifteen finite exclusions, each supported by a checked reverse-unit-propagation refutation. The main text presents the mathematical reductions and their dependencies; the accompanying supplement gives the complete cycle parameters, encodings, and certificate record. The previously known equality for orders 41 through 55 is cited directly.
ER -