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

DOI10.1090/MCOM/3732MaRDI QIDQ5097384zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Non-repetitive 3-coloring of subdivided graphs
• scientific article; zbMATH DE number 3976386
• Counting ternary square-free words quickly
• Avoiding or limiting regularities in words
• Non-repetitive tilings
• Square-free words with one possible mismatch
• A note on square-free shuffles of words
• Infinite words containing the minimal number of repetitions
• Rich square-free words
• Non-repetitive strings over alphabet lists

Cites work

• scientific article; zbMATH DE number 6004866 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• Another approach to non-repetitive colorings of graphs of bounded degree
• Growth rates of complexity of power-free languages
• New approach to nonrepetitive sequences
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• Nonrepetitive colouring via entropy compression
• Nonrepetitive graph colouring
• Nonrepetitive list colourings of paths
• Nonrepetitive vertex colorings of graphs
• Pathwidth and nonrepetitive list coloring
• Planar graphs have bounded nonrepetitive chromatic number
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• \((2+\epsilon )\)-nonrepetitive list colouring of paths

Cited in

(7)

• Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters
• Approaching repetition thresholds via local resampling and entropy compression
• Extensions and reductions of squarefree words
• How far away must forced letters be so that squares are still avoidable?
• Non-constructive upper bounds for repetition thresholds
• Non-repetitive strings over alphabet lists
• scientific article; zbMATH DE number 3976386 (Why is no real title available?)

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

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