A Construction of Modular Generalized Sidon Sets.
Charles C. Y. Lam, Alan C. H. Ling · Ars Combinatoria · 2014
A Sidon set S is a set of integers where the number of solutions to any integer k = k(1) + k(2) with k(1), k(2) is an element of S is at most g = 2. If g >= 3, the set S is a generalised Sidon set. We consider the Sidon sets modulo n, where the solutions to addition of elements are considered under a given modulus. In this note, we give a construction of a generalised Sidon set modulo n from any known Sidon set.