AdmissibleWords

Navigation page for Blueprint/D5/S1/Words/AdmissibleWords/ at upstream snapshot 880384c42100f2d04436d97c4ac862e91b4bba85.

Contents

• The Fibonacci Count of Zeckendorf-Admissible Words
• Relation-Space Growth for Admissible Words
• FibonacciGrayPath
• The 5040 time slice and its uniform Fisher law
• A smooth Fisher immersion of the five-mode simplex
• The five-mode Fisher Riemannian metric
• Mixed coordinates of the five-mode simplex
• Two-step growth of actual common polynomial images
• Actual endpoint operators and complete windows
• Sharp saturation by actual binary words
• Exact suffix images of actual words
• Additive responses of actual binary histories
• Direct concatenation without a separator
• Hamming capacity and shortest actual words
• Integer intervals represented by run-avoiding words
• Joint legal realization over a finite coefficient ring
• A simultaneous obstruction through nine bits
• Exact resonant block responses
• Resonant parity windows of the original weights
• Tight inequalities at corners of the path polytope
• Occupancy means on a finite path
• Quantitative uncrossing and native admissible occupancy fibers