Generative Structural Theory v1.140 — Residual Obstructions to Cross-Port Two-Step Connections
Year: 2026
Type: preprint
Abstract: This preprint studies two-step connections between leaf lifts of two minimally strongly connected directed graphs, K and K′, when each step may delete at most two edges. At either cross pair, the intermediate state can take either of two previously classified forms, one built from K and the other from K′. Theorem R gives an exact criterion for both forms to fail at a given cross pair t. This happens precisely when t belongs to neither graph, K has at least two witnesses at t, and at least one witness of K′ at t is an edge shared by both graphs. A witness is an edge that can be removed after t is added while preserving strong connectivity. Example P realizes this obstruction at both cross pairs on a base set of 20 vertices, even under the four-port grid condition (G). Lemma U shows that the endpoint conditions, the grid, and the obstruction at both cross pairs together imply the vertex condition (S) from v1.136. Example P therefore also satisfies (S). A second example, Example Q, realizes the obstruction on seven base vertices under the endpoint conditions alone. The question of whether another intermediate state or a longer sequence can connect the two leaf lifts remains open in this version. The verification appendix includes fixed-instance reachability checks for Example P and checks of agreement between the PDF and plain-text manuscript.
Author: Okino, Koji
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236183909
