An Improved Upper Bound for Colorings Without Symmetrically Colored k-Term Arithmetic Progressions

Ruizhe Shi, Yiqi Dong

For every even k≥4 and prime p>k, a coloring of Z/(p^(k²/4))Z uses (k−1)^(k²/4−1)p colors and avoids nontrivial symmetrically colored k-term arithmetic progressions. At k=4 this gives 27p colors and an O(N^(1/4)) interval bound.

Sources for this record

What was already known

Deng, Tidor and Zhao obtained O(N^(log₂₂3)) colors for four terms and asked whether N^o(1) colors suffice.

AI involvement AI-centered

Shi and Dong credit GPT-5.6 Sol with the key four-term construction idea. They developed the general even-k version and wrote its proof.

The source specifically credits the model with the key four-term construction idea retained in the result; the authors lead the wider development.

Importance Notable

Improves the four-term exponent from about 0.355 to one-quarter, while the subpolynomial target remains open.

Limitations

The authors prove the wider even-k construction; model credit is explicit for the four-term idea. No completed proof check of the final construction is documented.

Technical verification Reported

A proof is published, but no completed check by a named person or machine is explicitly documented. Author responsibility alone is not a completed checking method, so Reported is the evidence default.

Human understanding Full

The human authors explain the digit carry control, layered norm mapping and reduction from digitwise progressions that make the coloring work.

Correction and publication history

2026-10-18 · publication

Improves the four-term exponent from about 0.355 to one-quarter, while the subpolynomial target remains open.

Read this published revision