[seqfan] Re: Nathaniel Johnston's "orderings of pairs" A237749.

[Hans Havermann]

"The search for optimal Golomb rulers remains a challenging open problem. This problem is related to our paper: the smallest positive integer that is not a root of g_m(t) gives the length of an optimal Golomb ruler with m+1 markings. Our methods present new open problems, from the computation of g_m(t) to specific questions, e.g., about the period of gm(t) and the number of combinatorially different Golomb rulers with a given number of markings (this sequence starts with 1, 2, 10, 114, 2608, and 107498)."

Matthias Beck, Tristam Bogart, and Tu Pham: Enumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs (2011)

http://arxiv.org/abs/1110.6154


On Feb 18, 2014, at 9:08 AM, Neil Sloane <njasloane at gmail.com> wrote:

> Does any sequence fan recognize this problem?