Words / CONCEPT
Occupancy means on a finite path
The occupancy means of binary words with no adjacent ones form the polytope defined by coordinate bounds and adjacent-sum inequalities. In three coordinates this is a square-based pyramid.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
The path stable set polytope
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
- FibonacciGrayPathstructural-affinity · Closed
- Forbidden Neighbour Determinantstructural-affinity · Closed
- Minimum Covers of the Legal Digit Spacestructural-affinity · Closed
- Quantitative uncrossing and native admissible occupancy fibersstructural-affinity · Closed
- Reconstructing a nonhomogeneous legal binary chainstructural-affinity · Closed
- Relation-Space Growth for Admissible Wordsstructural-affinity · Closed
- The Fibonacci Count of Zeckendorf-Admissible Wordsstructural-affinity · Closed
- Tight inequalities at corners of the path polytopestructural-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