Jakub Przybyło

collaborators

4 papers

math.CO2026

Packing arithmetic progressions

Noga Alon, MichaÅ DÄbski, JarosÅaw Grytczuk +1

Let $F = {A_{1}, A_{2}, \dots, A_{k}}$ be a collection of finite arithmetic progressions, where each $A_{d}$ is an initial segment of the set $D_{d} = {d, 2 d, 3 d, \dots}$ of consecutiv…

math.CO2026

Homogeneous substructures in random ordered hyper-matchings

Andrzej Dudek, JarosÅaw Grytczuk, Jakub PrzybyÅo +1

An ordered $r$ -uniform matching of size $n$ is a collection of $n$ pairwise disjoint $r$ -subsets of a linearly ordered set of $r n$ vertices. For $n = 2$ , such a matching is called an…

math.CO2026

Homogeneous substructures in random ordered uniform matchings

Andrzej Dudek, JarosÅaw Grytczuk, Jakub PrzybyÅo +1

An ordered $r$ -uniform matching of size $n$ is a collection of $n$ pairwise disjoint $r$ -subsets of a linearly ordered set of $r n$ vertices. For $n = 2$ , such a matching is called an…

math.CO2024

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…