1 citations · 1 across the 7 of their papers we have counts for
16 papers
Extensions and reductions of square-free words
Michał Dębski, Jarosław Grytczuk, Bartłomiej Pawlik
A word is square-free if it does not contain a nonempty word of the form as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words…
Tight multiple twins in permutations
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
Two permutations are similar if they have the same length and the same relative order. A collection of disjoint, similar subsequences of a permutation form -twins in…
Square-free extensions of words
Jarosław Grytczuk, Hubert Kordulewski, Bartłomiej Pawlik
A word is square-free if it does not contain nonempty factors of the form . In 1906 Thue proved that there exist arbitrarily long square-free words over a -letter alphabet.…
On weak twins and up-and-down sub-permutations
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
Two permutations and are weakly similar if if and only if for all . Let be a permutati…
Square-free reducts of words
Jarosław Grytczuk, Szymon Stankiewicz
A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word…
Reflections on the Erd\H {o}s Discrepancy Problem
Bartłomiej Bosek, Jarosław Grytczuk
We consider some coloring issues related to the famous Erd\H {o}s Discrepancy Problem. A set of the form , with , is called a \emph{ho…