Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
From MaRDI portal
Publication:5636884
DOI10.2307/2316487zbMath0229.05002OpenAlexW4247013379MaRDI QIDQ5636884
Publication date: 1971
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2316487
Related Items (12)
On the structure and extendibility of \(k\)-power free words ⋮ Anagram-Free Colourings of Graphs ⋮ Which graphs allow infinite nonrepetitive walks? ⋮ Non-repetitive words: Ages and essences ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ \(2\times n\) grids have unbounded anagram-free chromatic number ⋮ Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem ⋮ On nonrepetitive sequences ⋮ Strongly non-repetitive sequences and progression-free sets ⋮ Thue type problems for graphs, points, and numbers ⋮ Relations on words ⋮ Splitting necklaces and measurable colorings of the real line
This page was built for publication: Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
