g-Golomb Rulers

A set of positive integers A is called a g-Golomb ruler if the difference between two distinct elements of A is repeated at most g times. This definition is a generalization of the Golomb ruler (g = 1). In this paper we construct g-Golomb ruler from Golomb ruler and we prove two theorems about extremal functions associated with this sets. Keywords: Sidon sets, B2 sets, Golomb ruler. To cite this article: Y. Caicedo, C.A. Martos, C.A. Trujillo, g-Golomb, Rev. Integr. Temas Mat. 33 (2015), No. 2, 161–172.