You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
For integers k and n, the anti-van der Waerden number aw(k,n) is the minimum t such that every t-coloring of {1,...,n} (that uses each color at least once) contains a k-term arithmetic progression whose elements have distinct colors (a rainbow k-AP). These numbers have connections with Szemeredi numbers.
For integers k and n, the anti-van der Waerden number aw(k,n) is the minimum t such that every t-coloring of {1,...,n} (that uses each color at least once) contains a k-term arithmetic progression whose elements have distinct colors (a rainbow k-AP). These numbers have connections with Szemeredi numbers.
See Rainbow arithmetic progressions for more.
Algorithms from derrickstolee/RainbowAPs can be adapted to this repo.
The text was updated successfully, but these errors were encountered: