Sidon set systems

From MaRDI portal
Publication:1998671




Abstract: A family mathcalA of k-subsets of 1,2,dots,N is a Sidon system if the sumsets A+B, A,BinmathcalA are pairwise distinct. We show that the largest cardinality Fk(N) of a Sidon system of k-subsets of [N] satisfies Fk(N)leN1choosek1+Nk and the asymptotic lower bound Fk(N)=Omegak(Nk1). More precise bounds on Fk(N) are obtained for kle3. We also obtain the threshold probability for a random system to be Sidon for kge2.









This page was built for publication: Sidon set systems

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