Minimum number of additive tuples in groups of prime order

From MaRDI portal
Publication:668091

zbMATH Open1439.11035arXiv1710.01936MaRDI QIDQ668091FDOQ668091


Authors: Ostap Chervak, Oleg Pikhurko, Katherine Staden Edit this on Wikidata


Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: For a prime number p and a sequence of integers a0,dots,akin0,1,dots,p, let s(a0,dots,ak) be the minimum number of (k+1)-tuples (x0,dots,xk)inA0imesdotsimesAk with x0=x1+dots+xk, over subsets A0,dots,AksubseteqmathbbZp of sizes a0,dots,ak respectively. An elegant argument of Lev (independently rediscovered by Samotij and Sudakov) shows that there exists an extremal configuration with all sets Ai being intervals of appropriate length, and that the same conclusion also holds for the related problem, reposed by Bajnok, when a0=dots=ak=:a and A0=dots=Ak, provided k is not equal 1 modulo p. By applying basic Fourier analysis, we show for Bajnok's problem that if pge13 and ain3,dots,p3 are fixed while kequiv1pmodp tends to infinity, then the extremal configuration alternates between at least two affine non-equivalent sets.


Full work available at URL: https://arxiv.org/abs/1710.01936

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (2)





This page was built for publication: Minimum number of additive tuples in groups of prime order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668091)