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
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: For a prime number and a sequence of integers , let be the minimum number of -tuples with , over subsets of sizes respectively. An elegant argument of Lev (independently rediscovered by Samotij and Sudakov) shows that there exists an extremal configuration with all sets being intervals of appropriate length, and that the same conclusion also holds for the related problem, reposed by Bajnok, when and , provided is not equal 1 modulo . By applying basic Fourier analysis, we show for Bajnok's problem that if and are fixed while 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The extent to which subsets are additively closed
- Sum-free sets in abelian groups
- Linear equations over \(\mathbb F_ p\) and moments of exponential sums.
- Equality in Pollard's theorem on set addition of congruence classes
- Addition Properties of Residue Classes
- Additive Combinatorics
- The number of additive triples in subsets of abelian groups
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)