Generative Structural Theory v1.156 -- Counting Connections at Every Deletion Total in the (1,0) Class of Example P

How many connections between two digraphs exist for each total number of deletions? In Example P, W′ and W are minimally strongly connected digraphs on the same 21 labelled vertices. We consider connections from W′ to W that keep all 26 common pairs, use exactly one ordered pair outside the union of the endpoints, and delete at most two pairs per step. Every intermediate graph must also be minimally strongly connected. The total number D of deletions is not fixed. For a fixed outside pair, such a connection is a walk on at most six states, and D is the weight of the walk. Only 11 of the 387 outside pairs support a connection. Exactly 29 connections visit no state twice: 21 with D = 5, six with D = 7, one with D = 8 and one with D = 10. Removing closed subwalks and inserting closed walks shows that connections exist exactly for D = 5 and for every D from 7 on, and that from D = 11 on every connection revisits a state. The number of connections for each D is obtained from five rational generating functions, each an entry of the inverse of I - A(z) for a transfer matrix A(z), using explicit recurrences for their coefficients. There are 63, 24, 248 and 182 connections with D = 7, 8, 9 and 10, and the paper lists the counts up to D = 32. After the derivation, the counts were compared with saved data of v1.155, v1.153, v1.150 and v1.146 and agree with them. The general two-deletion question (Q1) remains open. The accompanying files include the paper in PDF and plain text, the proof checks with their inputs, and the programs for reproducing the PDF. Reproducing the proof checks also requires the computational appendix of v1.150.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-22
DOI
https://doi.org/10.5281/zenodo.24417083
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Generative Structural Theory v1.156 -- Counting Connections at Every Deletion Total in the (1,0) Class of Example P

Koji Okino
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Generative Structural Theory v1.156 -- Counting Connections at Every Deletion Total in the (1,0) Class of Example P

Koji Okino
preprint en

Abstract

How many connections between two digraphs exist for each total number of deletions? In Example P, W′ and W are minimally strongly connected digraphs on the same 21 labelled vertices. We consider connections from W′ to W that keep all 26 common pairs, use exactly one ordered pair outside the union of the endpoints, and delete at most two pairs per step. Every intermediate graph must also be minimally strongly connected. The total number D of deletions is not fixed. For a fixed outside pair, such a connection is a walk on at most six states, and D is the weight of the walk. Only 11 of the 387 outside pairs support a connection. Exactly 29 connections visit no state twice: 21 with D = 5, six with D = 7, one with D = 8 and one with D = 10. Removing closed subwalks and inserting closed walks shows that connections exist exactly for D = 5 and for every D from 7 on, and that from D = 11 on every connection revisits a state. The number of connections for each D is obtained from five rational generating functions, each an entry of the inverse of I - A(z) for a transfer matrix A(z), using explicit recurrences for their coefficients. There are 63, 24, 248 and 182 connections with D = 7, 8, 9 and 10, and the paper lists the counts up to D = 32. After the derivation, the counts were compared with saved data of v1.155, v1.153, v1.150 and v1.146 and agree with them. The general two-deletion question (Q1) remains open. The accompanying files include the paper in PDF and plain text, the proof checks with their inputs, and the programs for reproducing the PDF. Reproducing the proof checks also requires the computational appendix of v1.150.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Generative Structural Theory v1.156 -- Counting Connections at Every Deletion Total in the (1,0) Class of Example P — Koji Okino · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS