Caro–Hegarty–Morrison quadratic-order conjecture for arithmetic-progression zero sums

Let rr and ss be fixed positive integers. For a function f:[n]{r,s}f:[n]\to\{-r,s\} with f([n])=0f([n])=0, let M(r,s,k)M(r,s,k) denote the minimum threshold such that every sufficiently large nn forces a zero-sum kk-term arithmetic progression. Caro–Hegarty–Morrison's conjecture. There are positive constants c1=c1(r,s)c_1=c_1(r,s) and c2=c2(r,s)c_2=c_2(r,s) such that

c1k2M(r,s,k)c2k2.c_1k^2\le M(r,s,k)\le c_2k^2.

Thus the threshold for zero-sum arithmetic progressions has quadratic order in kk. Existing results give superlinear lower bounds and quadratic upper bounds, but the matching quadratic lower bound remains open.

Sources & referencesView supporting material

Primary source

Alec Sun, “Zero-sum subsequences in bounded-sum \-r,s\-sequences”, arXiv:1907.06623 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.