Lower-bounds on the growth of power-free languages over large alphabets

DOI10.1007/s00224-021-10040-1OpenAlexW3151276656MaRDI QIDQ2230725

Matthieu Rosenfeld

Publication date: 28 September 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.05192

zbMATH Keywords

exponential growthcombinatorics on wordspower-free languagesfractional repetitions

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Strict bounds for pattern avoidance
• Growth properties of power-free languages
• Last cases of Dejean's conjecture
• Further applications of a power series method for pattern avoidance
• Growth of power-free languages over large alphabets
• Another approach to non-repetitive colorings of graphs of bounded degree
• Exponential lower bounds for the number of words of uniform length avoiding a pattern
• Sur un théorème de Thue
• Doubled patterns are 3-avoidable
• A proof of Dejean’s conjecture

This page was built for publication: Lower-bounds on the growth of power-free languages over large alphabets