Generative Structural Theory v1.152 — Classifying Reverse Connections with Eight Deletions in Example P
There are exactly 14,686,633 reduced connections from W′ to W in Example P that use eight edge deletions in total. Of these, 13,025,938 visit no state twice. The remaining 1,660,695 revisit at least one state and were classified in v1.151. Theorem N7 completes the classification by counting both groups according to the number of steps and the ordered pairs used along the connection. Every state is a minimally strongly connected digraph on the same 21 labelled vertices. Consecutive states must differ. Each step may delete at most two ordered pairs and may add pairs outside W ∪ W′. Counting connections by their sequences of interior states gives 308,743 with four steps, 4,247,010 with five, 7,371,957 with six, and 2,758,923 with seven. The classification also tracks two quantities. Q counts the distinct pairs outside W ∪ W′ that occur in an interior state. The quantity c counts the distinct pairs in W ∩ W′ that are absent from at least one interior state. All ten classes allowed by Q ≥ 1 and Q + c ≤ 4 occur. Every four-step connection avoids revisits, as does every connection in the classes (4, 0) and (1, 3). In the class (1, 0), exactly one of the 24 connections visits no state twice. Two enumeration methods build their own transition graphs. One searches forwards from W′. The other constructs reachable states from W′ and enumerates backwards from W. The paper proves that each method enumerates every reduced connection with at most eight deletions exactly once. The two computations produced the same set of 14,862,065 labelled state sequences across those deletion totals. The computational appendix includes the programs, inputs, complete sequence files from both methods, and instructions for reproducing the counts.
Authors
- Koji Okino (ORCID: https://orcid.org/0009-0003-9273-9813)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24368585
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint