2 citations · 2 across the 6 of their papers we have counts for
6 papers
Shuffle squares and ordered nest-free graphs
Jarosław Grytczuk, Bartłomiej Pawlik, Andrzej Ruciński
A shuffle square is a word consisting of two shuffled copies of the same word. For instance, the Turkish word $\mathtt{\color{red}{ik}\color{blue}{i}\color{red}{li}\color{blue}{kli…
Words Avoiding Tangrams
Michał Dębski, Jarosław Grytczuk, Bartłomiej Pawlik +2
A \emph{tangram} is a word in which every letter occurs an even number of times. Such word can be cut into parts that can be arranged into two identical words. The minimum number o…
Variations on shuffle squares
Jarosław Grytczuk, Bartłomiej Pawlik, Mariusz Pleszczyński
We study decompositions of words into subwords that are in some sense similar, which means that one subword may be obtained from the other by a relatively simple transformation. Ou…
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…
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.…
The Girth of Cayley graphs of Sylow 2-subgroups of symmetric groups on diagonal bases
Bartłomiej Pawlik
A diagonal base of a Sylow 2-subgroup of symmetric group is a minimal generating set of this subgroup consisting of elements with only one non-zero coordinate in…