Skip to content
DraconiticResearch
Search Sources API
190,851 studies31 sourcesUpdated 28 min ago
PreprintarXiv licencearXiv

A Four-by-Four Obstruction to Polynomial Removal for Ordered Binary Matrices

  • Zinan Wang
Open at sourcePDFDOICite

Abstract

We exhibit a fixed 4× 4 binary matrix with no polynomial induced ordered removal bound. At depth h≥ 1, let m=2h. Our explicit host has order (14h+2)m, exactly 2m6+1/2(m−2)m5 induced copies, and exact editing distance m2 cells. Its normalized editing distance is Θ(h−2), while its induced-copy density is Θ(4−hh−8). The lower bound holds against arbitrary cell edits through an injective family of m2 protected selections. An exhaustive arithmetic classification identifies every induced copy and proves that a matching canonical repair creates none. The original-copy transversal number is exactly m, yielding an unbounded gap between hitting existing copies and eliminating all copies. The identities and the obstruction at every depth are formalized in Lean, with verification sources included as ancillary files.

Related

  1. On Recoding Ordered Treatments as Binary Indicators*
    Evan K. Rose, Yotam Shem-Tov
    The review of economics and statisticsPeer-reviewedLicence not statedFull text1 citedStatisticsPMC
  2. Large deviations for the largest eigenvalue of a polynomial in Gaussian matrices
    Alice Guionnet, Jonathan Husson, Jana Reker
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  3. Counting Integral Matrices with Given Cubic Characteristic Polynomial
    Philipp Habegger
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Counting matrices with given characteristic polynomial
    Tim Browning, Fabian Gundlach, Will Sawin
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Generalized Ordered Rough Set Models via Minimal and Maximal Neighborhoods Induced by Binary Relations
    Salama H. Shalil, Mostafa K. El-Bably, Mostafa A. El-Gayar +1
    AxiomsPeer-reviewedCC BY 4.0General mathematicsCrossref

Cite

BibTeXRIS
BibTeX
@misc{wang2026fourbyfour,
  title = {{A Four-by-Four Obstruction to Polynomial Removal for Ordered Binary Matrices}},
  author = {Zinan Wang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.15370},
  eprint = {2610.15370},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.15370},
}
RIS
TY  - UNPB
TI  - A Four-by-Four Obstruction to Polynomial Removal for Ordered Binary Matrices
AU  - Zinan Wang
PY  - 2026
DA  - 2026/10/11
PB  - arXiv
DO  - 10.48550/arxiv.2610.15370
UR  - https://arxiv.org/abs/2610.15370
AB  - We exhibit a fixed 4× 4 binary matrix with no polynomial induced ordered removal bound. At depth h≥ 1, let m=2^h. Our explicit host has order (14h+2)m, exactly 2m^6+1/2(m−2)m^5 induced copies, and exact editing distance m^2 cells. Its normalized editing distance is Θ(h^−2), while its induced-copy density is Θ(4^−hh^−8). The lower bound holds against arbitrary cell edits through an injective family of m^2 protected selections. An exhaustive arithmetic classification identifies every induced copy and proves that a matching canonical repair creates none. The original-copy transversal number is exactly m, yielding an unbounded gap between hitting existing copies and eliminating all copies. The identities and the obstruction at every depth are formalized in Lean, with verification sources included as ancillary files.
ER  -