Research
I study the Social Golfer Problem: how many rounds can players be arranged into equal-sized groups without any pair sharing a group twice?
These two preprints present constructions and schedules. Each includes supplementary data and a standalone validator, archived on Zenodo.
Papers
-
Parallel-Class Splitting and Constructive Lower Bounds for the Social Golfer Problem
Guido Witt-Dörring · Preprint · September 2026
Constructions from resolvable designs, including parallel-class splitting, together with explicit schedules that establish lower bounds for several parameter pairs.
-
A Constructive Frontier for the Social Golfer Problem
Guido Witt-Dörring · Preprint · September 2026
A table of constructive lower bounds for every pair of group counts and sizes from 2 to 50, with 1,225 complete schedules and 33 improvements over cited published lower bounds.
Both papers disclose AI assistance in the research and manuscript drafting. Manuscripts and schedules are available under CC BY 4.0; validator code is MIT licensed.