Discrepancy of Sums of two Arithmetic Progressions
From MaRDI portal
Abstract: Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set 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 ( fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form in , where the are arithmetic progressions. For this hypergraph Hebbinghaus (2004) proved a lower bound of . Note that the probabilistic method gives an upper bound of order for all fixed . Pv{r}'{i}vv{e}tiv'{y} improved the lower bound for all to in 2005. Thus, the case (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 for the discrepancy of the hypergraph of sums of two arithmetic progressions.
Recommendations
Cites work
- Discrepancy in arithmetic progressions
- Discrepancy of arithmetic progressions in higher dimensions
- Discrepancy of cartesian products of arithmetic progressions
- Discrepancy of Sums of Arithmetic Progressions
- Discrepancy of sums of three arithmetic progressions
- Geometric discrepancy. An illustrated guide
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 863495 (Why is no real title available?)
- Remark concerning integer sequences
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(5)
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)