Minimum number of additive tuples in groups of prime order

MaRDI QIDQ668091zbMATH OpenFDO

Authors Ostap Chervak, Oleg Pikhurko, Katherine Staden

Publication date 5 March 2019

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

Full work available at URL https://arxiv.org/abs/1710.01936, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p30

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

zbMATH Keywords

affine non-equivalent sets

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Extremal combinatorics (05D99)

Abstract: For a prime number $p$ and a sequence of integers $a_0,dots,a_{k}in0,1,dots,p$, let $s(a_0,dots,a_k)$ be the minimum number of $(k+1)$-tuples $(x_0,dots,x_k)in{A}_{0}imesdotsimes{A}_k$ with $x_0=x_1+dots+x_k$, over subsets $A_0,dots,A_{k}subseteqmathbb{Z}_p$ of sizes $a_0,dots,a_k$ respectively. An elegant argument of Lev (independently rediscovered by Samotij and Sudakov) shows that there exists an extremal configuration with all sets $A_i$ being intervals of appropriate length, and that the same conclusion also holds for the related problem, reposed by Bajnok, when $a_0=dots=a_k=:a$ and $A_0=dots=A_k$, 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,p-3$ are fixed while $kequiv1pmodp$ tends to infinity, then the extremal configuration alternates between at least two affine non-equivalent sets.

Recommendations

• Sums and \(k\)-sums in abelian groups of order \(k\)
• Counting \(k\)-sumsets in groups of prime order
• Two addition theorems on groups of prime order
• The number of k-sums of abelian groups of order k
• Subset sums modulo a prime

Cites work

• scientific article; zbMATH DE number 1318047 (Why is no real title available?)
• scientific article; zbMATH DE number 3232871 (Why is no real title available?)
• Addition Properties of Residue Classes
• Additive Combinatorics
• Equality in Pollard's theorem on set addition of congruence classes
• Linear equations over \(\mathbb F_ p\) and moments of exponential sums.
• Sum-free sets in abelian groups
• The extent to which subsets are additively closed
• The number of additive triples in subsets of abelian groups

Cited in

(2)

• The maximum size of \((k,l)\)-sum-free sets in cyclic groups
• Structure and supersaturation for intersecting families

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)