The length of short words in unavoidable sets

DOI10.1142/S0218196711006522MaRDI QIDQ3097923zbMATH OpenOpenAlexFDO

Authors Peter M. Higgins

Publication date 10 November 2011

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196711006522

zbMATH Keywords

Fibonacci numberfree monoidgolden ratiounavoidable set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• Unavoidable sets of words of uniform length
• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
• Unavoidable sets
• Unavoidable Set: Extension and Reduction
• UNAVOIDABLE SETS OF CONSTANT LENGTH

Cites work

• On extendibility of unavoidable sets
• UNAVOIDABLE SETS OF CONSTANT LENGTH

Cited in

(11)

• On the length of word chains
• WORDS GUARANTEEING MINIMUM IMAGE
• scientific article; zbMATH DE number 3849232 (Why is no real title available?)
• scientific article; zbMATH DE number 736284 (Why is no real title available?)
• Unavoidable Set: Extension and Reduction
• Unavoidable sets of partial words of uniform length
• Lower density selection schemes via small universal hitting sets with short remaining path length
• Bounds on Zimin word avoidance
• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
• Unavoidable sets
• Weakly self-avoiding words and a construction of Friedman

This page was built for publication: The length of short words in unavoidable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097923)