2 citations · 5 across the 25 of their papers we have counts for
5 papers · 1 filter
On a Problem of Steinhaus
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +4
Let be a positive integer. A sequence of points in the unit interval is piercing if $\{x_1,x_2,\ldots,x_n\}\cap \left[\frac{i}{n},\frac{i+1}{n}…
Long twins in random words
Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński
Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of positions. We investigate the maximum length of twins in a random word over a -lette…
Multiple twins in permutations
Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
By an -tuplet in a permutation we mean a family of pairwise disjoint subsequences with the same relative order. The length of an -tuplet is defined as the length of any s…
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.…