Combinatorics / CONCEPT
Actual membership words and cyclic boundaries
Actual labelled subsets are equivalent to their Boolean membership functions, and original-host visibility is exactly periodic forbidden-factor avoidance.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
Full original host length
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 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
- Rooted original-geodesic geometrystructural-affinity · Closed
- Separators and reachability in one surviving graphstructural-affinity · Closed
- The Andrasfai forbidden languagestructural-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