paper

Sidon sets with -separated sumsets in additive number theory

arXiv:2608.07416

Abstract

The set is a -set if every element of the sumset has a unique representation as a sum of elements of . A -set is also called a Sidon set. A -set is a -set whose sumset is -separated, that is, for all with . Upper and lower bounds are obtained for the cardinality of the largest -sets contained in , that is, sets such that, if and , then .

Revised and improved with new open problems; 11 pages