A set of non-negative integers is a Golomb ruler if differences , for any , are all distinct. A set of disjoint Golomb rulers (DGR) each being a -subset of is called an . Let be the least positive such that there is an . In this paper, we propose a series of conjectures on the constructions and structures of DGR. The main conjecture states that if is any set of positive integers such that , then there are disjoint Golomb rulers, each being a -subset of , which generalizes the conjecture proposed by Koml{'o}s, Sulyok and Szemer{'e}di in 1975 on the special case . These conjectures are computationally verified for some values of and through modest computation. Eighteen exact values of and ten upper bounds on are obtained by computer search for and . Moveover for and $10 \leq J \leq 13H(I,J)=IJ$ are determined without difficulty.

生成讲解博客的中文版本

生成AI智能校验的中文版本