Metraipolis › archive › dc_565b5ad86da0

Orthodox queen domination: finite constructions and an asymptotic density gap — arXiv:2609.01513

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01513
License (as archived)
CC0-1.0
Archived
2026-10-17T07:06:25.487Z
SHA-256 of the archived text
c74df89e4c3b93a044bf9c1d9e5f4c8e108052bfbfcfdb2ee98188809d2a2897
Stable URL of this page
https://metraipolis.com/documento/dc_565b5ad86da0

How to cite

Orthodox queen domination: finite constructions and an asymptotic density gap — arXiv:2609.01513 — arXiv (en), https://arxiv.org/abs/2609.01513 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_565b5ad86da0 (Metraipolis archive dc_565b5ad86da0, sha256 c74df89e4c3b93a044bf9c1d9e5f4c8e108052bfbfcfdb2ee98188809d2a2897)
BibTeX
@misc{dc565b5ad86da0,
  title = {Orthodox queen domination: finite constructions and an asymptotic density gap — arXiv:2609.01513},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01513},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_565b5ad86da0; sha256 c74df89e4c3b93a044bf9c1d9e5f4c8e108052bfbfcfdb2ee98188809d2a2897},
  year = {2026}
}

Archived text

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

An orthodox dominating set on an $n\times n$ chessboard occupies every row of one parity and every column of a possibly different parity. For $n\ge400001$, every such set contains more than $(1/2+1/80000)n-2$ queens, on odd and even boards and with attacking or boundary queens allowed. Second-moment estimates and an exact rational line-weight certificate give a stronger bound for $p$-covers; finite diagonal completion and board extension transfer it to orthodox covers. The cost of extending an arbitrary dominating set to an orthodox cover yields an inequality with an explicit defect term. The previously constructed independent, border-free Type-A $1$-cover of $Q_{221}$ with $111$ queens supplies a finite seed. Classical amplification gives ordinary and independent domination upper bounds with coefficients $112/221$ and $113/221$, respectively. Its order 221 is below the density threshold 400001. For admissible seeds whose orders tend to infinity, the lower limit of these coefficients is at least $1/2+1/16000$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.01513 — 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-10-17T06:52:59.702Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).