Combinatorics / CONCEPT
Enumeration prerequisites for the original identity
An explicit finite equivalence counts labelled periodic avoiding words by transfer traces.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
Uniform periodic-word cardinality
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
- Counting based labelled closed runsstructural-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