Complexity

Navigation page for Blueprint/D5/S1/Words/Complexity/ at upstream snapshot b27a6b9d0e4bc3cb6a8527d5d5d13173a32e821b.

Contents

• ExactDecks
• An Invariant Measure on the Golden Word Subshift
• Invariant Measures Have Full Support
• The Minimal Forward-Shift Action on the Golden Subshift
• Minimality of the Golden Word Subshift
• Uniform Finite-Pattern Recurrence Across the Golden Subshift
• LyndonBrackets
• Christoffel words need not attain the Lyndon-factor minimum
• The Lower Mechanical Complexity Characterization
• Intercept Independence of Irrational Mechanical Subshifts
• Minimality of Irrational Lower Mechanical Word Subshifts
• Density and Slope Rigidity of Mechanical Subshifts
• The One-Sided Morse-Hedlund Theorem
• Natural Valuations Cannot Preserve Every Abelian Complexity Function
• PositivePairs
• Finite Prefix Reflection for Infinite Word Sets
• ShuffleOrders
• Polynomial Complexity and Subshift Hausdorff Dimension
• Topology and Cardinality of Word Subshifts
• Even Reduced Abelian Complexity
• Odd Reduced Abelian Complexity of the Thue-Morse Word
• A Counterexample Inside Vivion’s Restricted Class