Combinatorics / CONCEPT
The Andrasfai forbidden language
The exact finite forbidden language and uniqueness of closed labelled lifts.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS0
Finite language equivalence
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
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
- Enumeration prerequisites for the original identitystructural-affinity · Closed
- Italian dominating functions on cyclesstructural-affinity · Closed
- The corrected transfer-trace seriesstructural-affinity · Closed
- The source model and separator conventionsstructural-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