Metraipolis › archive › dc_7bf0a773640d
Certified Countermodels in Profile and Incidence Fibres of Diamond-Induced Edge Partitions — arXiv:2608.21648
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21648
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:29:50.633Z
- SHA-256 of the archived text
47f2c8da97c4d3e0de3f9ae304288bb81861884f1e46ed0cffe351a530704ba4- Stable URL of this page
https://metraipolis.com/documento/dc_7bf0a773640d
How to cite
Certified Countermodels in Profile and Incidence Fibres of Diamond-Induced Edge Partitions — arXiv:2608.21648 — arXiv (en), https://arxiv.org/abs/2608.21648 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7bf0a773640d (Metraipolis archive dc_7bf0a773640d, sha256 47f2c8da97c4d3e0de3f9ae304288bb81861884f1e46ed0cffe351a530704ba4)
BibTeX
@misc{dc7bf0a773640d,
title = {Certified Countermodels in Profile and Incidence Fibres of Diamond-Induced Edge Partitions — arXiv:2608.21648},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21648},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7bf0a773640d; sha256 47f2c8da97c4d3e0de3f9ae304288bb81861884f1e46ed0cffe351a530704ba4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21648. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G=(V,E)$ be a finite loopless directed graph. Each directed two-step diamond identifies its two pairs of opposite edges, and the connected components of the resulting auxiliary graph on $E$ define a canonical partition $\Pi_{\mathrm{opp}}(G)$. We ask whether a finite relational certificate built from the blocks of an edge partition identifies this canonical partition. We prove the functoriality and a universal coarsening property of $\Pi_{\mathrm{opp}}(G)$, count its complete fixed-profile fibre and its exact radius-one transposition neighbourhood, and reduce the parity condition in the certificate to an odd closed walk in a directed $\mathbb Z_2$-gain graph. In a fixed catalogue, four labelled target-positive rows, representing three isomorphism types, each admits a noncanonical positive partition obtained by a single cross-block transposition. In one row a stronger positive comparison partition also preserves every per-vertex, fixed-role incoming and outgoing count; it arises from a 12-edge alternating trade. The corresponding incidence fibre is a singleton in the other three rows. A deterministic 64-index family of comparison partitions yields 78 bounded positives among 256 nonidentity partitions. On the same profile fibre, one member has a complete 885-element relation semigroup and no write-preserve-use certificate, giving an exact negative. Thus the certificate has genuine but intermediate selectivity: it is neither determined by block sizes nor specific to the canonical target. The claims are finite statements in computational combinatorics and are supported by explicit, independently checkable certificates.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.21648 — 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-18T08:27:54.383Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).