Combinatorics / CONCEPT
Counting based labelled closed runs
Boolean labelled closed runs of the original four-state partial automaton are counted by powers of its transfer matrix, uniformly at every positive length.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
The uniform cardinality and trace identity
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Actual membership words and cyclic boundariesstructural-affinity · Closed
- Actual subset counts and Howroyd's generating identitystructural-affinity · Closed
- Andrasfai mutual-visibility obstructionsstructural-affinity · Closed
- CZX parent Lindbladian steady statestructural-affinity · Closed
- Enumeration prerequisites for the original identitystructural-affinity · Closed
- Italian dominating functions on cyclesstructural-affinity · Closed
- The Andrasfai forbidden languagestructural-affinity · Closed
- The corrected transfer-trace seriesstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance