ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

c1k2≤M(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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.