Words

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

Contents

• AbelianBorders
• AdmissibleWords
• Antipowers
• Longest clustering words in Arnoux–Rauzy languages
• AssociatedMersenne
• Attractors
• Even-Length Barker Sequences and the Mod-Four Boundary Obstruction
• The Bit-Deletion Grundy Function
• BlockPalindromes
• Unary Neighborhood Minimality Refuted
• Poisson Error for Closed Fair Words
• Run Starts in a Closed Boolean Word
• Complexity
• Compositions
• Davis’s Coprime Width-Descent Difference Formula
• Double-Tail Self-Shuffle Support
• Exact Endpoint-Word Shuffle Support
• Episturmian
• EvilOdious
• Expansions
• Incidence Dynamics of Fibonacci Substitution Words
• Fibonacci Word Progression Bound
• First Starts at Fibonacci Differences
• Forbidden
• Golden Fiber Coordinates
• Golden Gap Prefix Chain
• Golden Mechanical Word Window
• GoldenRecovery
• Pointwise Substitution Fixed Point of the Golden Word
• Uniform Recurrence of the Golden Word
• The Infinite Golden Word
• GraphRepresentation
• Hofstadter
• Actual Masks and the Block Exchange Minimum
• Periodic Masks and an Exact Shifted Successor
• Exact Native Unary Block Exchanges
• Unary and Reverse-Unary Native Insertion
• Iteration-Depth No-Gap for Literal Insertion
• An Exact Factor Window for the m-Bonacci Word
• Actual Weights and Full Greedy Necessity
• Minimum Parikh Cardinality and Sentinel Lengths
• The Uniform m-bonacci Parikh and Greedy Characterization
• Reversed Prefixes Are Fully Right-Special
• Sentinel Desubstitution of the m-bonacci Word
• Mechanical
• NegativeExpansions
• Palindromes
• ParityCode
• Greedy Remainders and Ordered Image Prefixes
• Patterns
• Permutations
• PostLie
• Powers
• Effective iteration bound for binary rank-one morphisms
• Morphism Iteration Bound Arithmetic
• Morphism Iteration Bound Automaton
• Morphism Iteration Bound Checker
• Morphism Iteration Bound Cyclic
• Morphism Iteration Bound Defs
• Morphism Iteration Bound Digits
• Morphism Iteration Bound Extraction
• Morphism Iteration Bound Finite
• Morphism Iteration Bound Fixed Word
• Morphism Iteration Bound Infinite Presentation
• Morphism Iteration Bound Normalization
• Morphism Iteration Bound Period
• Morphism Iteration Bound Presentation
• Morphism Iteration Bound Primitivity
• Morphism Iteration Bound Reduction
• Morphism Iteration Bound Residues
• Morphism Iteration Bound Soundness
• Morphism Iteration Bound Source Residues
• ReturnWords
• Sequenceability
• A Sturmian Cumulative Bound Fails
• Sumfree
• Transient Letters and Palindromic Complexity
• Dyadic Thue-Morse Identities
• First Longest Thue-Morse Progressions
• Infinite Odd Fibers of Thue-Morse Maxima
• TwoBlockSubstitution
• 2-Boolean Persistence Refutation
• Two centered abelian periods
• TwoDeletionRunDecks
• Unary Gaps of Actual Words
• Normalization of weak shuffle products
• Zeckendorf-Beatty Bridge
• Order on Zeckendorf Representations