17 citations · 29 across the 4 of their papers we have counts for
1 paper · 1 filter
Nils Hebbinghaus
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theor…