trureturingGitHub MATHEMATICAL ATLAS

Words / CONCEPT

The Fibonacci Count of Zeckendorf-Admissible Words

Binary words with no two consecutive ones are counted by a Fibonacci number.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES25
PROOF DEPTH0
DOCUMENT LINKS0
THEOREM

Admissibility as exclusion

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
The Fibonacci Count of Zeckendorf-Admissible WordsThe Fibonacci Count ofZeckendorf-Admissible WordsMinimum Covers of the Legal Digit SpaceMinimum Covers of the LegalDigit SpaceRelation-Space Growth for Admissible WordsRelation-Space Growth forAdmissible WordsFibonacciGrayPathFibonacciGrayPathOccupancy means on a finite pathOccupancy means on a finitepathQuantitative uncrossing and native admissible occupancy fibersQuantitative uncrossing andnative admissible occupancyfibersGolden Dynamical DeterminantGolden Dynamical DeterminantLiteral Windows and Positive EndLiteral Windows and PositiveEndLiteral installation and actual Read lower boundsLiteral installation and actualRead lower boundsNativeFibonacciActiveTableNativeFibonacciActiveTableOriginal vector recovery by a complete legal wordOriginal vector recovery by acomplete legal wordSparse original parity and finite recoverySparse original parity andfinite recoveryShort Common Canonical Fibonacci ProbesShort Common CanonicalFibonacci ProbesDegrees and the sharp count bound for legal wordsDegrees and the sharp countbound for legal wordsLegal-word block growthLegal-word block growthConstrained harmonic optimizationConstrained harmonicoptimizationCounting legal-word toggle edges by deletionCounting legal-word toggleedges by deletionReconstructing a nonhomogeneous legal binary chainReconstructing a nonhomogeneouslegal binary chainLegal Markov block weights and persistent mixture minorsLegal Markov block weights andpersistent mixture minorsSigned boundaries of legal-word toggle graphsSigned boundaries of legal-wordtoggle graphsLegal chain moment and phase reductionLegal chain moment and phasereductionForbidden Neighbour DeterminantForbidden Neighbour DeterminantSupersymmetric fermion chain: EndpointIdentitySupersymmetric fermion chain:EndpointIdentitySupersymmetric fermion chain: HardCoreCompressionSupersymmetric fermion chain:HardCoreCompressionSupersymmetric fermion chain: HardCoreModelSupersymmetric fermion chain:HardCoreModelThe classical value of the odd polygon gameThe classical value of the oddpolygon game
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

None recorded in this release.

Certified topology / DOWNSTREAM

Consequences

RELATED KNOWLEDGE

Structural connections

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 archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
0
Layer
D5/S1
Domain
Words
Node ID
D5/S1/Words/AdmissibleWords/AdmissibleCount
Repository path
D5/S1/Words/AdmissibleWords/AdmissibleCount.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.