A short proof that shuffle squares are 7-avoidable
From MaRDI portal
Recommendations
- A proof of the shuffle conjecture
- scientific article; zbMATH DE number 1842502
- Lattice-Based Proof of a Shuffle
- Proofs of Restricted Shuffles
- The shuffle conjecture
- A Proof of the Seven Cube Theorem
- A note on the shuffle variant of Jeśmanowicz' conjecture
- A short proof of two shuffling theorems for tilings and a weighted generalization
- The case \(k=2\) of the shuffle conjecture
- A counterexample to the shuffle compatiblity conjecture
Cites work
- Application of entropy compression in pattern avoidance
- Doubled patterns are 3-avoidable
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- Further applications of a power series method for pattern avoidance
- New approach to nonrepetitive sequences
- Strict bounds for pattern avoidance
Cited in
(9)- On shuffling of infinite square-free words
- Recognizing binary shuffle squares is \textsf{NP}-hard
- On shuffled-square-free words
- A note on square-free shuffles of words
- Square-free words with square-free self-shuffles
- Avoiding or limiting regularities in words
- Square-free shuffles of words
- Approaching repetition thresholds via local resampling and entropy compression
- Non-constructive upper bounds for repetition thresholds
This page was built for publication: A short proof that shuffle squares are 7-avoidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186679)
