论文信息 - Discrepancy in arithmetic progressions

Discrepancy in arithmetic progressions

It is proven that there is a two-coloring of the first n integers for which all arithmetic progressions have discrepancy less than const.n1/4. This shows that a 1964 result of K. F. Roth is, up to constants, best possible. Department of Applied Mathematics, Charles University, Malostranske nam. 25, 118 00 Praha 1, Czech Republic E-mail address: matousek@kam.mff.cuni.cz Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, New York 10012 E-mail address: spencer@cs.nyu.edu License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use

Jiří Matoušek | Joel Spencer | J. Spencer | J. Matousek | J. Matoušek

[1] K. F. Roth. Remark concerning integer sequences , 1964 .

[2] D. Kleitman,et al. On a combinatorial problem of Erdős , 1966 .

[3] D. Kleitman. On a combinatorial conjecture of Erdös , 1966 .

[4] H. L. Abbott,et al. On A Combinatorial Problem of Erdös , 1969, Canadian Mathematical Bulletin.

[5] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[6] József Beck,et al. Roth’s estimate of the discrepancy of integer sequences is nearly sharp , 1981, Comb..

[7] J. Spencer. Six standard deviations suffice , 1985 .

[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9] Jirí Matousek,et al. Tight upper bounds for the discrepancy of half-spaces , 1995, Discret. Comput. Geom..