Exact compression of shortest Boolean corridors
This provisional preprint studies the sixteen boundary costs of a Boolean pair-cost network with four boundary bits and a strict gap between its two parity classes. Assuming synchronized preferred minimizing assignments and the stated finite-sector exclusions, a normalized shortest corridor has an exact realization with at most nineteen genuine pair interactions, treewidth at most two, nonnegative rational table entries, and the original separate constant. The construction uses a joint comparison of the two ends to select an affordable withdrawal and create a new minimizing assignment. A separate four-triangle example has no exact realization on four specified nineteen-scope layouts at its original constant, even when every target table is free and its entries may be arbitrary nonnegative reals. Both results are provisional. The support archive includes the worked example, exact certificates and reproducibility instructions.
Authors
- Robert Barritz
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24405052
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint