Return
Discrepancy in arithmetic progressions
DOI:10.1090/S0894-0347-96-00175-0.png)
Abstract
En 中文
It is proven that there is a two-coloring of the first n integers for which all arithmetic progressions have discrepancy less than const.n(1/4). This shows that a 1964 result of K. F. Roth is, up to constants, best possible.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.2
Papers:
749
Citations:
4.7K
Organization
No organization information available

