Discrepancy of Sums of two Arithmetic Progressions

From MaRDI portal



Abstract: 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 theory for a long time. An extension of this classical hypergraph is the hypergraph of sums of k (kgeq1 fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form A1+A2+hdots+Ak in [N], where the Ai are arithmetic progressions. For this hypergraph Hebbinghaus (2004) proved a lower bound of Omega(Nk/(2k+2)). Note that the probabilistic method gives an upper bound of order O((NlogN)1/2) for all fixed k. Pv{r}'{i}vv{e}tiv'{y} improved the lower bound for all kgeq3 to Omega(N1/2) in 2005. Thus, the case k=2 (hypergraph of sums of two arithmetic progressions) remained the only case with a large gap between the known upper and lower bound. We bridge his gap (up to a logarithmic factor) by proving a lower bound of order Omega(N1/2) for the discrepancy of the hypergraph of sums of two arithmetic progressions.











This page was built for publication: Discrepancy of Sums of two Arithmetic Progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503517)