Avoiding squares over words with lists of size three amongst four symbols

DOI10.1090/mcom/3732OpenAlexW3153156308MaRDI QIDQ5097384

Matthieu Rosenfeld

Publication date: 23 August 2022

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

square-free wordslist colorings

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Approaching repetition thresholds via local resampling and entropy compression ⋮ Extensions and reductions of squarefree words ⋮ Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters

Cites Work

• Unnamed Item
• Unnamed Item
• Pathwidth and nonrepetitive list coloring
• Nonrepetitive colouring via entropy compression
• Nonrepetitive vertex colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• Growth rates of complexity of power-free languages
• Nonrepetitive graph colouring
• Another approach to non-repetitive colorings of graphs of bounded degree
• \((2+\epsilon )\)-nonrepetitive list colouring of paths
• Nonrepetitive list colourings of paths
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences
• Planar graphs have bounded nonrepetitive chromatic number
• Nonrepetitive colorings of graphs

This page was built for publication: Avoiding squares over words with lists of size three amongst four symbols