J. Grytczuk

activity

20112026

most citedA new approach to nonrepetitive sequences

42 citations · 109 across the 37 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

A rainbow partition theorem for trees and connected maximin share allocations of chores

Marcin Anholcer, Maciej Bartkowiak, Bartłomiej Bosek +3

Xiao, Qiu, and Huang (AAMAS 2023) and independently Lonc (personal communication) asked whether indivisible chores located at the vertices of a tree can always be allocated to $n$ …

math.OC2026

Epistemic fair division of independence structures

Marcin Anholcer, Maciej Bartkowiak, Bartłomiej Bosek +1

We study the problem of fair division of indivisible goods with constraints imposed by a prescribed independence structure, that is, a family of subsets of goods closed under takin…

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 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…