Metraipolis › archive › dc_cdca3998ed35

Boolean Rank Nine for Polygons with 35 to 40 Vertices — arXiv:2611.01674

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01674
License (as archived)
CC0-1.0
Archived
2026-11-03T18:49:46.764Z
SHA-256 of the archived text
a1ea2c53efbf1d860e4e310489d659b0d8d86b4783672b7b103ffe9b010882f9
Stable URL of this page
https://metraipolis.com/documento/dc_cdca3998ed35

How to cite

Boolean Rank Nine for Polygons with 35 to 40 Vertices — arXiv:2611.01674 — arXiv (en), https://arxiv.org/abs/2611.01674 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cdca3998ed35 (Metraipolis archive dc_cdca3998ed35, sha256 a1ea2c53efbf1d860e4e310489d659b0d8d86b4783672b7b103ffe9b010882f9)
BibTeX
@misc{dccdca3998ed35,
  title = {Boolean Rank Nine for Polygons with 35 to 40 Vertices — arXiv:2611.01674},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01674},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cdca3998ed35; sha256 a1ea2c53efbf1d860e4e310489d659b0d8d86b4783672b7b103ffe9b010882f9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01674. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01674 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:38.076Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).