A conjecture on a continuous optimization model for the Golomb Ruler Problem

A Golomb Ruler (GR) is a set of integer marks along an imaginary ruler such that all the distances of the marks are different. Computing a GR of minimum length is associated to many applications (from astronomy to information theory). Although not yet demonstrated to be NP-hard, the problem is computationally very challenging. This brief note proposes a new continuous optimization model for the problem and, based on a given theoretical result and some computational experiments, we conjecture that an optimal solution of this model is also a solution to an associated GR of minimum length.

[1]  Leo Liberti,et al.  Six mathematical gems from the history of distance geometry , 2015, Int. Trans. Oper. Res..

[2]  Leo Liberti,et al.  An Introduction to Distance Geometry applied to Molecular Geometry , 2017, SpringerBriefs in Computer Science.

[3]  Antonio Mucherino,et al.  Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures , 2018, Ann. Oper. Res..

[4]  Giuseppe Thadeu Freitas de Abreu,et al.  Design of Orthogonal Golomb rulers with applications in wireless localization , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[5]  James B. Shearer.  Symmetric Golomb squares , 2004, IEEE Transactions on Information Theory.

[6]  F. Biraud,et al.  Some new possibilities of optimum synthetic linear arrays for radioastronomy. , 1975 .

[7]  Carlile Lavor,et al.  Euclidean Distance Geometry - an Introduction , 2017, Springer undergraduate texts in mathematics and technology.

[8]  J. Singer.  A theorem in finite projective geometry and some applications to number theory , 1938 .

[9]  G.S. Bloom,et al.  Applications of numbered undirected graphs , 1977, Proceedings of the IEEE.

[10]  S. Sidon.  Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen , 1932 .

[11]  Leo Liberti,et al.  Distance Geometry: Theory, Methods, and Applications , 2013, Distance Geometry.

[12]  Leo Liberti,et al.  Euclidean Distance Geometry and Applications , 2012, SIAM Rev..

[13]  P. Alam.  ‘W’ , 2021, Composites Engineering.

[14]  Burak Kocuk,et al.  A Computational Comparison of Optimization Methods for the Golomb Ruler Problem , 2019, CPAIOR.

[15]  James B. Shearer,et al.  Some new optimum Golomb rulers , 1990, IEEE Trans. Inf. Theory.

[16]  Arthur J. Bernstein,et al.  A class of binary recurrent codes with limited error propagation , 1967, IEEE Trans. Inf. Theory.

[17]  W. C. Babcock.  Intermodulation interference in radio systems frequency of occurrence and control by channel selection , 1953 .

[18]  Periklis A. Papakonstantinou,et al.  On the complexity of constructing Golomb Rulers , 2009, Discret. Appl. Math..

[19]  Apostolos Dollas,et al.  A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler , 1998, IEEE Trans. Inf. Theory.

[20]  P. Alam.  ‘L’ , 2021, Composites Engineering: An A–Z Guide.

[21]  P. Erdös,et al.  On a problem of sidon in additive number theory, and on some related problems , 1941 .

[22]  Konstantinos Drakakis,et al.  A review of the available construction methods for Golomb rulers , 2009, Adv. Math. Commun..

[23]  Ralph Lorentzen,et al.  Application of linear programming to the optimal difference triangle set problem , 1991, IEEE Trans. Inf. Theory.

[24]  Brigitte Jaumard,et al.  Equivalence of some LP-based lower bounds for the Golomb ruler problem , 2006, Discret. Appl. Math..

[25]  Willem Jan van Hoeve,et al.  A Lagrangian Relaxation for Golomb Rulers , 2013, CPAIOR.