I am interested in a sharp bound on the largest possible size $e_3({\boldsymbol{Z}_n})$ of a subset $S \subset \boldsymbol{Z}_n$ such that for any three distinct elements $a, b, c \in S$ we have $a+b \not= 2c$.

The best upper and lower bounds I could find through usual means such as Mathscinet were by T. Sanders, *Ann. of Math.* **174** (2011) 619–636 and M. Elkin, *Proc. SODA* (2010) 886–905 respectively, where a non-modulo version is considered, i.e., they gave bounds on the largest possible size $e_3({N})$ of a subset $S \subset N =\{1,2,\dots,n\}$ such that for any three distinct integers $a, b, c \in S$ it holds that $a+b \not= 2c$.

Any $S$ containing no $3$-term APs in the modulo $n$ sense is automatically a no-$3$-term-AP subset in the sense of the non-modulo $n$ version, so we have $e_3({\boldsymbol{Z}_n}) \leq e_3({N})$. The converse may not be true, but apparently we have $e_3({N}) \leq e_3({\boldsymbol{Z}_{2n}})$. So asymptotically speaking, $e_3({\boldsymbol{Z}_n})$, which I want to know, behaves pretty much the same way as $e_3({N})$. But to my layman eye, the actual values of these two may be ever so slightly different.

My question is, how large can this "same difference" be? Is there serious research somewhere exactly on this?

I'm sorry if I'm missing something quite obvious; the inequalities $e_3({\boldsymbol{Z}_n}) \leq e_3({N}) \leq e_3({\boldsymbol{Z}_{2n}})$ look too elementary.

Edit: Fixed minor typos. Also, as quid's comments suggest, the above inequalities may not be as "bad" as they look in the sense that it may be very tough or well into the diminishing returns zone to study nontrivial information on the structure of best possible sets or extract it from known results. At least the elementary argument does the job as far as $e_3({\boldsymbol{Z}_n})$'s asymptotic behavior goes in the Landau symbols' sense. My thanks goes to quid for the series of informative comments and also Robert for the interesting computation.

upper boundfor the integer caseisin fact a bound for the cyclic case plus (essentially) the inequality you mention. So, Sanders's paper is (also) the best known for the cyclic case (see the final section to notice this). You could use his tech. results directly for cyclic but all this would be absorbed in the constant of the big-Oh. I think this is still best (see Gowers's blog gowers.wordpress.com/2011/02/05/polymath6-a-is-to-b-as-c-is-to for discussion on project for improve. but it seems it didn't yet suceed). – user9072 Jan 2 '13 at 17:12