English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The \emph{anti-van der Waerden number}, denoted by $aw([n],k)$, is thesmallest $r$ such that every exact $r$-coloring of $[n]$ contains a rainbow$k$-term arithmetic progression. Butler et. al. showed that $\lceil \log_3 n\rceil + 2 \le aw([n],3) \le \lceil \log_2 n \rceil + 1$, and conjectured thatthere exists a constant $C$ such that $aw([n],3) \le \lceil \log_3 n \rceil +C$. In this paper, we show this conjecture is true by determining $aw([n],3)$for all $n$. We prove that for $7\cdot 3^{m-2}+1 \leq n \leq 21 \cdot 3^{m-2}$,\[ aw([n],3)=\left\{\begin{array}{ll} m+2, & \mbox{if $n=3^m$}\\ m+3, &\mbox{otherwise}.  \end{array}\right.\]

Anti-van der Waerden numbers of 3-term arithmetic progressions