J. Grytczuk

activity

20242026

collaborators

11 papers

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 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.CO2025

Neighborly boxes and strings with jokers; constructions and asymptotics

JarosÅaw Grytczuk, Andrzej P. Kisielewicz, Krzysztof PrzesÅawski

We study families of axis-aligned boxes in a $d$ -dimensional Euclidean space $R^{d}$ whose placement is restricted by bounds on the dimension of their pairwise intersections…

math.CO2025

Mrs. Correct and Majority Colorings

Marcin Anholcer, BartÅomiej Bosek, JarosÅaw Grytczuk +3

A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…