Small Sets with Large Difference Sets

From MaRDI portal
Publication:6287064

arXiv1705.08760MaRDI QIDQ6287064FDOQ6287064


Authors: Luka Milićević Edit this on Wikidata


Publication date: 24 May 2017

Abstract: For every epsilon>0 and kinmathbbN, Haight constructed a set AsubsetmathbbZN (mathbbZN stands for the integers modulo N) for a suitable N, such that AA=mathbbZN and |kA|<epsilonN. Recently, Nathanson posed the problem of constructing sets AsubsetmathbbZN for given polynomials p and q, such that p(A)=mathbbZN and |q(A)|<epsilonN, where p(A) is the set p(a1,a2,dots,an)phantom.colonphantom.a1,a2,dots,aninA, when p has n variables. In this paper, we give a partial answer to Nathanson's question. For every kinmathbbN and epsilon>0, we find a set AsubsetmathbbZN for suitable N, such that AA=mathbbZN, but |A2+kA|<epsilonN, where A2+kA=a1a2+b1+b2+dots+bkphantom.colonphantom.a1,a2,b1,dots,bkinA. We also extend this result to construct, for every kinmathbbN and epsilon>0, a set AsubsetmathbbZN for suitable N, such that AA=mathbbZN, but |3A2+kA|<epsilonN, where 3A2+kA=a1a2+a3a4+a5a6+b1+b2+dots+bkphantom.colonphantom.a1,dots,a6,b1,dots,bkinA.













This page was built for publication: Small Sets with Large Difference Sets

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