A Verified Witness Corpus of 2,404 Rooted Permutation Tables of Order 56
This release contains 2,404 explicit finite witnesses encoded as rooted permutation tables of order 56, together with an exact SHA-256 inventory and two independent deterministic verification programs. For every witness, exhaustive verification confirms the required component-table conditions, all 56 root-star tests, all 3,080 rooted route rows, zero matches among 1,552,320 triangle tests, and exactly 110 complete directed pairs among 3,080. Both verifiers recompute every stated predicate directly from the raw witness bytes. Complete per-witness verification records are included. The archive contains exactly 2,404 pairwise byte-distinct encodings. Pairwise nonisomorphism and exhaustive classification are not claimed.
Authors
- Nicholas Coleman (ORCID: https://orcid.org/0000-0002-5374-739X)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-09-19
- DOI
- https://doi.org/10.5281/zenodo.22847321
- Primary Topic
- Natural Language Processing Techniques
- Type
- preprint