WorksMathematics
Golomb rulers with real marks: the real and integer optima agree up to ten marks
Abstract
A Golomb ruler is a set of integer marks whose pairwise differences are distinct. We let the marks be real numbers and ask that every difference be at least 1 and that any two differences be at least 1 apart. Every integer Golomb ruler satisfies these conditions, so the least length of such a real ruler with marks is at most the optimal Golomb length . Fixing the order of all differences splits the real problem into finitely many polyhedral chambers. A branch-and-bound over these chambers, with an exact rational certificate at every leaf, proves for . Each proof takes under a minute and is verified by an independent checker that uses only exact arithmetic. An exhaustive exact enumeration of all chamber vertices confirms the result for , and shows that there the shortest real rulers are exactly the optimal integer rulers and their mirror images. For every we show , so that . Non-integral chamber vertices first appear at : there are 84, all half-integral. Already there, 80 of them are shortest points of their chambers, 40 of them the only one, although the global optimum is integral; a twelve-mark example of the same kind comes from Singer's construction. On the other hand, every Singer ruler with at most 104 marks, cut at the largest gap, is the only shortest point of its own chamber; we conjecture this for all prime powers.
Introduction
A Golomb ruler with marks is a set of integers whose differences () are pairwise distinct. Let be the least possible length . For it is 1, 3, 6, 11, 17, 25, 34, 44, 55 (OEIS A003022 [13]). It is known for , in each case by exhaustive computer search; the last cases were completed by distributed.net in 2022 [5].
Definition 1. A real 1-separated ruler with marks is a sequence of real numbers with for all and for all pairs with and . Let be the infimum of over such rulers.
For integer marks, distinct differences are automatically at least 1 apart, so every Golomb ruler is a real 1-separated ruler and . The question is whether real marks can ever do better. The same relaxation of the Erdős distinct subset sums problem was studied in [12], where the real and integer optima agree for . For rulers the structure is simpler, because every condition involves only two differences.
Results. Real and integer optima agree for every . The proof is a certified branch-and-bound (Section 3). For an exhaustive enumeration of all chamber vertices gives an independent proof, identifies all shortest real rulers (Theorem 2), and shows the first non-integral vertices. Section 6 shows that most of these are shortest points of their chambers, with a short certificate for one of them (Proposition 1), and gives a twelve-mark example from Singer's construction (Proposition 2). So chamber optima can be non-integral even where the global optimum is integral, and Section 6 also shows that no universal floor/ceiling rounding explains the integral optima. Section 7 shows that every Singer ruler for a prime power up to 103 is the only shortest point of its chamber, and conjectures this in general. Section 8 proves for all (Theorem 3), so that .
Chambers, vertices and valid inequalities
Write and use the gaps as coordinates. Every difference equals for the interval , where is its indicator vector. Hence every condition of Definition 1 reads for in the relation set : the interval indicators (among them the unit vectors, giving ) and the differences of two distinct intervals, each normalized so that its first nonzero entry is , with repetitions removed. for .
For a sign vector on with on the unit vectors, the chamber is the set of with for all . The real 1-separated rulers form the disjoint union of the nonempty chambers. A chamber corresponds to a choice of the order of all differences, which is a combinatorial type of real Golomb ruler in the sense of Beck, Bogart and Pham [2].
Lemma 1 (vertices). is attained. It is the least total length over the finite set of points such that (i) for a matrix whose rows are linearly independent elements of and a sign vector , and (ii) for all and for all .
Proof. A nonempty chamber is a polyhedron contained in . It contains no line, and the length is bounded below on it and strictly increasing along every recession direction. By the fundamental theorem of linear programming its minimum over the chamber is attained, at a vertex, where linearly independent defining inequalities hold with equality: for independent rows . Such a point has the form (i), and it satisfies (ii) because it lies in the chamber. Conversely, every point satisfying (ii) is a real 1-separated ruler. ■
By Cramer's rule is an integer vector. A feasible vertex is integral if is an integer vector; it is then an integer Golomb ruler.
Lemma 2 (packing). Any distinct differences of a real 1-separated ruler have sum at least , because they are at least 1 and pairwise at least 1 apart. In particular the largest difference, , is at least . Since , and are Golomb rulers, for .
Lemma 3 (sub-rulers). For the marks form, after translation, a real 1-separated ruler with marks, so .
Lemma 4 (symmetry). The mirror image of a real 1-separated ruler is again one, of the same length, with the gaps in reverse order. The gaps and () are two distinct differences, so . Hence a lower bound proved for all rulers with holds for all rulers.
The certified branch-and-bound
To prove we search a binary tree. A node is described by its path, a list of branching rows with ; the root has an empty path. At each node we solve the linear program: minimize subject to the rows valid at the node, which are
: (Definition 1);
: for every interval of marks with (Lemma 3), where for (Lemma 2) and for , as certified by the proofs for smaller ;
: packing cuts for a set of distinct intervals (Lemma 2), added when the LP point violates one;
: (Lemma 4);
: the branching rows of the path.
If the LP value is at least , the node is a leaf and receives a certificate: multipliers with and for rows valid at the node. For every point of the node, the length then equals . (An empty node would instead receive a Farkas certificate, with ; none was needed.) Otherwise we add a violated packing cut if there is one, and then branch on the relation with the smallest at the LP point: the children add and . Every ruler satisfies , so the two children cover the node. If the LP point satisfied every relation, it would be a real ruler shorter than , and the proof would fail.
The LP is solved in floating point by HiGHS 1.15.1 [17]. The certificates are exact: the rows that are tight in HiGHS's optimal basis are taken, and the multipliers are obtained from them by solving a linear system in rational arithmetic. They are kept only if they are nonnegative and give exactly. Floating point therefore only guides the search; the proof rests on the certificates.
The checker (Real_Golomb_rulers_check.py) uses only the Python standard library and exact fractions. For a proof file it recomputes and the intervals from and compares them with the file. It checks that the tree has one root, that every internal node has exactly the two children and for a relation , and that every leaf has a valid certificate. It checks that every row used is one of the kinds listed above, with an index in range, and with each packing cut and sub-ruler bound within what Lemmas 2 and 3 allow. Sub-ruler bounds for are accepted only together with the proof for , which is checked recursively. Finally, it checks an optimal integer ruler for the upper bound. Checking the proof for , with its whole chain for , takes about 3 seconds.
Tests. With the target raised by 1 (), the search must fail. For it does: it finds exactly the optimal integer rulers, one of each mirror pair. The checker rejects a proof with open leaves, a proof in which one multiplier was changed, and proofs with malformed or out-of-range row references (for example a row with outside , which would read ). For the result agrees with the enumeration of Section 5.
Results
Theorem 1. For , , that is, 1, 3, 6, 11, 17, 25, 34, 44, 55.
Proof. For this is Lemma 2. For the proof files of Table 1 give . They are built in the order , each using the bounds for smaller as sub-ruler rows. The upper bound comes from optimal integer rulers , , , , and .
| target | nodes | leaves | packing cuts | max depth | time | proof file | |
| 5 | 11 | 11 | 6 | 7 | 4 | 0.01 s | 2.5 KB |
| 6 | 17 | 47 | 24 | 16 | 6 | 0.03 s | 8.7 KB |
| 7 | 25 | 643 | 322 | 55 | 15 | 0.4 s | 94 KB |
| 8 | 34 | 3,823 | 1,912 | 128 | 23 | 3.3 s | 0.57 MB |
| 9 | 44 | 15,929 | 7,965 | 298 | 32 | 19 s | 2.5 MB |
| 10 | 55 | 18,425 | 9,213 | 332 | 29 | 33 s | 3.1 MB |
Table 1. The certified proofs of , each run on one process of a laptop (Intel Core Ultra 7 155U).
The proof is computer-assisted. Every step can be checked with the published checker, without the LP solver.
Exhaustive enumeration of the vertices for
Lemma 1 also gives a direct method. Enumerate every -element subset of . For each subset, fraction-free Gauss–Jordan elimination in exact integer arithmetic gives and ; every division is checked to be exact, and is checked afterwards. All integers involved are small: in Bareiss's fraction-free elimination [1] every intermediate entry is, up to sign, a minor of , hence by Hadamard's inequality at most in absolute value for , so no numerator exceeds and the 64-bit arithmetic cannot overflow; the floating-point product has integer partial sums below 400, so it is exact. For each sign vector , keep the point if it satisfies (ii). We ran this in pure Python for and in a vectorized numpy version for : 4,925,156,775 subsets, 6.3 hours on 10 worker processes. The numpy version reproduces every count of the Python version for and 6.
Every feasible vertex lies in exactly one chamber, and every chamber contains a feasible vertex (Lemma 1). The vertices found meet 2, 10, 114, 2,608 and 107,498 chambers for . These are exactly the numbers of combinatorially different real Golomb rulers listed by Beck, Bogart and Pham [2 Section 5], which also form OEIS A237749 [13]. So the enumeration met every chamber.
| subsets | nonsingular | solutions by | feasible vertices | chambers | non-integral | ||
| 3 | 4 | 6 | 6 | 1: 2 | 2 | 2 | 0 |
| 4 | 12 | 220 | 189 | 1: 10 | 10 | 10 | 0 |
| 5 | 30 | 27,405 | 21,035 | 1: 176 | 118 | 114 | 0 |
| 6 | 65 | 8,259,888 | 5,903,710 | 1: 6,296; 2: 2 | 3,144 | 2,608 | 0 |
| 7 | 126 | 4,925,156,775 | 3,365,649,124 | 1: 425,802; 2: 1,378; 3: 2 | 165,522 | 107,498 | 84 |
Table 2. The enumeration. “Solutions” are the (subset, sign) pairs that give a feasible vertex, by . “Chambers” is the number of distinct chambers containing a feasible vertex.
Theorem 2. For the real 1-separated rulers of length are exactly the optimal Golomb rulers below and their mirror images:
: and ;
: , , and ;
: , , , and .
Proof. The enumeration finds the least length over the finite set of Lemma 1, attained only at these rulers and their mirror images (4, 8 and 10 vertices). They lie in pairwise different chambers. In each chamber the length is minimized on a bounded face, the convex hull of the optimal vertices of that chamber, so each of these chambers has a unique shortest ruler, and no other real ruler has length . The next shortest feasible vertices have lengths 12, 18 and 26. ■
Non-integral vertices and optima
Up to every feasible vertex is integral. At , two solutions come from subsets with , but their vertices are integral and are also reached by subsets with . At the first non-integral feasible vertices appear: 84 of them, all half-integral. Two solutions come from subsets with , but no vertex has denominator 3. The shortest non-integral vertex has length 33, far above $G_{\mathbb{Z}}(7) = 25:
, with differences , which are pairwise at least 1 apart. So the simple route to for all , “every vertex is integral”, fails. A sharper question is whether a non-integral vertex can be the shortest point of its chamber. For each of the 84 vertices we solved the linear program of its chamber and recorded an exact certificate. For 80 of them a multiplier vector with over rows of the chamber has equal to the length of the vertex, so the vertex is a shortest point of its chamber. For 40 of these the rows with have rank 6, so the vertex is the only shortest point; for the other 40 a second point of the chamber with the same length is given. Each of the remaining 4 comes with a shorter point of its chamber (Table 3). These verdicts do not depend on the completeness of the enumeration; only the list of 84 vertices does.
| the vertex is | vertices | shortest of them |
| the only shortest point of its chamber | 40 | 42 |
| a shortest point, not the only one | 40 | 33 |
| not a shortest point | 4 | 38 |
Table 3. The chambers of the 84 non-integral vertices at .
So non-integral chamber optima occur already at , the first with non-integral vertices, although is attained only at integer rulers (Theorem 2). The shortest of them, , shares the optimal face of its chamber with the integer ruler . The same happens for separated subset sums [12]: some chambers there have non-integral optimal vertices, but none beats the integer optimum for . The shortest unique example has a short certificate.
Proposition 1 (seven marks). The real 1-separated ruler is the only shortest point of its chamber.
Proof. The 21 differences of are . They are at least 1 and pairwise at least 1 apart, so lies in its chamber. Table 4 lists six rows of the chamber that are tight at , with multipliers 8, 4, 7, 6, 9, 8. Their weighted sum is , so no point of the chamber is shorter than 42, and a point of length 42 satisfies the six rows with equality. The six rows have determinant 2, so that point is . ■
| row of the chamber | multiplier | differences at |
| 8 | ||
| 4 | ||
| 7 | ||
| 6 | ||
| 9 | ||
| 8 |
Table 4. The certificate of Proposition 1. Each row says that two differences that are consecutive in the order of differ by at least 1; the last column gives their values at .
With twelve marks there is an example from Singer's construction.
Proposition 2 (twelve marks). Let , a Golomb ruler with marks. The only shortest point of its chamber is the half-integral ruler , of length 121.
Proof. Let be the differences in the order they have in . The chamber of is the set of with and for ; these rows imply all others. The differences of come in the same order as those of and are pairwise at least 1 apart, so lies in the chamber. Exactly 24 rows are tight at P. Table 5 lists them with multipliers , for which and in exact arithmetic. Hence every point of the chamber has length , with equality only if all 24 rows are tight at . These rows have rank 11, so .
| in X | in P | y | in X | in P | y |
| 2 → 3 | 2 → 3 | 25/2 | 23 → 24 | 21 → 22 | 1/2 |
| 3 → 4 | 3 → 4 | 1/2 | 29 → 31 | 27 → 28 | 1/2 |
| 7 → 9 | 7 → 8 | 19/2 | 36 → 37 | 65/2 → 67/2 | 1/2 |
| 9 → 10 | 8 → 9 | 11/2 | 39 → 40 | 71/2 → 73/2 | 25/2 |
| 10 → 11 | 9 → 10 | 1/2 | 43 → 44 | 79/2 → 81/2 | 23/2 |
| 13 → 15 | 25/2 → 27/2 | 1/2 | 46 → 48 | 85/2 → 87/2 | 1/2 |
| 15 → 16 | 27/2 → 29/2 | 57/2 | 58 → 59 | 105/2 → 107/2 | 1/2 |
| 16 → 17 | 29/2 → 31/2 | 59/2 | 61 → 62 | 111/2 → 113/2 | 1/2 |
| 19 → 20 | 17 → 18 | 1/2 | 62 → 63 | 113/2 → 115/2 | 1/2 |
| 20 → 21 | 18 → 19 | 1/2 | 63 → 64 | 115/2 → 117/2 | 1/2 |
| 21 → 22 | 19 → 20 | 7/2 | 64 → 65 | 117/2 → 119/2 | 1/2 |
| 22 → 23 | 20 → 21 | 1/2 | 98 → 99 | 89 → 90 | 1/2 |
Table 5. The 24 rows tight at P in Proposition 2. Each row says that two differences that are consecutive in the order of X differ by at least 1. It is given by the two differences in X and in P, and by its multiplier y.
X is a cut of a Singer perfect difference set modulo 133 [16], cut at a gap that is not the largest; it was found while testing whether Singer rulers are the shortest points of their chambers. Its mirror image gives the mirror case. Both examples are far above the integer optimum (42 against , and 121 against ), so they do not bear on Theorem 1.
Remark (rounding). Simple rounding does not account for the integral global optima. Rounding each of the five half-integral marks of P in Proposition 2 to its floor or its ceiling never gives a Golomb ruler of length at most 121. At , the half-integral real 1-separated ruler
a shortest point of the chamber of another Singer cut, is not even within 1 of an integer Golomb ruler of length at most 176: no such ruler has every mark between the floor of the corresponding mark minus 1 and its ceiling plus 1. Among 1,936 non-integral chamber optima and vertices for (the 84 vertices of Table 3, four minima from the Singer test of § 7, and chamber optima found by a walk through neighbouring chambers), rounding to floors and ceilings fails for 1,050. These examples rule out a universal length-nonincreasing floor/ceiling rounding procedure, even one that may move each mark one step further.
Singer rulers
For a prime power , Singer [16] constructs a set D of residues modulo whose differences cover every non-zero residue exactly once, a perfect difference set; so does every multiple with . Cutting the circle at a gap between two consecutive elements of and reading the elements as integers in gives a Golomb ruler with marks, shortest when the cut is at the largest gap. We call these rulers, cut at the largest gap, Singer rulers. The shortest Singer ruler for each has length for and 28, that is, for every with a prime power except and 17, where it is longer by 1, 1 and 2. The ruler of Theorem 1 for is itself a perfect difference set modulo 91.
Computation. For every prime power (37 values of , up to 104 marks) and every multiplier , we solved the linear program of the chamber of the Singer ruler and certified the result exactly as in § 6: in each case a multiplier vector with and equal to the length, positive on rows of rank . So each of these 24,450 distinct rulers is the only shortest point of its own chamber, including those for , 9 and 17, which are not globally optimal. For we also tested the cuts at all other gaps (116,868 rulers in all), again with every verdict certified exactly: from on each of them is the only shortest point of its chamber, while for there are 396 that are not shortest points and 18 that are shortest but not the only one, each with an exact second point of the same length. Proposition 2 comes from one of these.
Conjecture. For every prime power , every Singer ruler is the only shortest point of its chamber.
Chamber optimality is local and does not bound by itself. For the analogous relaxation of distinct subset sums, the Conway–Guy and Bohman sets have structured dual certificates valid for all [12]; a certificate of that kind for Singer rulers, built from the cyclic structure of , would prove the conjecture.
Bounds for all n
Theorem 3. For every , . In particular .
Proof. Let be a real 1-separated ruler, fix , and for real let be the number of marks in . Then outside an interval of length , and . Two marks at distance both lie in for a set of of length , so is the sum of over the differences . These are at least 1 and pairwise at least 1 apart, so the -th smallest is at least , and the sum is at most . By the Cauchy–Schwarz inequality . Hence , that is, , and the choice gives . For the upper bound let be the least prime with . A Singer set modulo has elements whose differences are distinct even modulo , so any of them, read as integers in , form a Golomb ruler of length at most . By the prime number theorem . ■
The lower bound is the counting argument of Erdős and Turán [7] for Sidon sets. It uses only that the differences are at least 1 apart, so it applies to real rulers unchanged; no bound of this counting kind can tell from . Theorem 3 gives ; whether the difference is always 0 is the main open question.
Related work
Beck, Bogart and Pham [2] introduced real Golomb rulers and their combinatorial types in order to count integer rulers with Ehrhart theory for inside-out polytopes; Bogart and Cuéllar [3] extended this to generalized rulers. Neither paper studies the separated minimum . Kocuk and van Hoeve [8] compare integer, constraint and quadratic programming methods for certifying optimal integer rulers, up to 14 marks. They make one of their models exact by branching on or , the dichotomy as our branching, but inside an integer model with integer bounds. Their bounds are the integer counterpart of our sub-ruler rows. The linear-programming lower bounds of Lorentzen and Nilsen [9] and others, shown to coincide by Meyer and Jaumard [10], rest on packing inequalities like those of Lemma 2, which also hold for real 1-separated rulers. Duxbury, Lavor and Salles-Neto [6] propose a different continuous model: the marks stay at integer positions, and the 0–1 variables that say which positions carry a mark are relaxed to . They conjectured that this non-convex model is exact, on evidence from a local solver; Ouzia [14] presents a proof of the conjecture and corrects the outputs of their greedy heuristic. In that model the marks remain at integer positions, so the question does not bear on . Nathanson [11] bounds the size of integer Sidon sets whose sumset is -separated, for a positive integer . The conditions of Definition 1 say exactly that the sums () are pairwise at least 1 apart, so such a set with least element 0, divided by , is a real 1-separated ruler with marks in , and conversely. Let be the least largest element of such a set with elements. Since is attained at a rational point (Lemma 1), is the minimum of over the positive integers , and says exactly that for every positive integer . We found no earlier study of itself.
Open problems
Is for every ? Theorem 3 gives . A first with would need a non-integral chamber optimum below , and by the remark of § 6 no universal floor/ceiling rounding can rule this out.
and 12. Random-dive estimates of the tree size suggest about – nodes for and – for , that is, hours on one process; we have not run them.
Uniqueness for , 9, 10: are the shortest real rulers again exactly the optimal integer rulers? The proofs of Theorem 1 give only the length.
Non-integral chamber optima exist from on (§ 6), yet no global optimum found so far is non-integral. What keeps them away from the optimum? How close to can a non-integral chamber optimum come? At the shortest has length 33, against .
Prove the conjecture of § 7 for all prime powers, for instance by structured dual certificates as for the Conway–Guy and Bohman sets in [12]; and ask the same for the rulers of Bose [4] and Ruzsa [15].
Data and code
The Zenodo record of this note, doi:10.5281/zenodo.23843508 (https://doi.org/10.5281/zenodo.23843508, which always resolves to the latest version), contains the archive Real_Golomb_rulers_code_data.zip, with these parts and a list of SHA-256 checksums:
the branch-and-bound (
Real_Golomb_rulers_bnb.py, needs numpy and highspy);the checker (
Real_Golomb_rulers_check.py);the six proof files for , …, 10 (
data/bnb/, JSON lines);the exact check of Propositions 1 and 2 and of the remark of § 6 (
Real_Golomb_rulers_propositions_check.py), which rebuilds the chambers, checks every entry of Tables 4 and 5, and searches all the roundings of the remark;the certificates behind Table 3 (
data/n7_nonintegral_chambers.json) and their checker (Real_Golomb_rulers_n7_chambers_check.py), which also recomputes the 84 vertices from the enumeration output;the Singer chamber test of § 7 (
Real_Golomb_rulers_singer_chambers.py, needs numpy and highspy) and the rounding search behind the remark of § 6 (Real_Golomb_rulers_rounding.py), with their outputs (data/singer_chambers/,data/rounding/);the exact certificates for the 258 Singer chamber verdicts whose uniqueness the first run decided only in floating point (
data/singer_chambers/recheck_2026-11-17.json), the program that produced them (Real_Golomb_rulers_singer_recheck.py, needs numpy and highspy) and their checker (Real_Golomb_rulers_singer_recheck_check.py);the vertex enumeration in pure Python and numpy, with a C version that was not used;
all enumeration outputs (
data/real_golomb_runs/).
To check Theorem 1 for : `python -I Real_Golomb_rulers_check.py ../data/bnb/proof_n10_T55.json with --dep m:../data/bnb/proof_n<m>_T<G_Z(m)>.json for m = 5, ..., 9 and --upper 0,1,6,10,23,26,34,41,53,55. To check Propositions 1 and 2, the remark of Section 6 and Table 3: python -I Real_Golomb_rulers_propositions_check.py and python -I Real_Golomb_rulers_n7_chambers_check.py; for the certificates of Section 7: python -I Real_Golomb_rulers_singer_recheck_check.py. The four checkers use only the Python standard library, and every check raises an error explicitly, so they also check under python -O. The archive README gives the exact commands. License: CC BY 4.0.
Acknowledgements
The research was directed by the author, who used Claude (Anthropic) for the programs and a draft of the paper; the author checked the results.
References
- [1]E. H. Bareiss, Sylvester's identity and multistep integer-preserving Gaussian elimination, Math. Comp. 22 (1968), 565–578.DOI
- [2]M. Beck, T. Bogart, T. Pham, Enumeration of Golomb rulers and acyclic orientations of mixed graphs, Electron. J. Combin. 19(3) (2012), P42; arXiv:1110.6154.arxiv.org/abs/1110.6154
- [3]T. Bogart, D. F. Cuéllar, An Ehrhart theoretic approach to generalized Golomb rulers, arXiv:2308.11118 (2023).arxiv.org/abs/2308.11118
- [4]R. C. Bose, An affine analogue of Singer's theorem, J. Indian Math. Soc. (N.S.) 6 (1942), 1–15.DOI
- [5]distributed.net, Project OGR (optimal Golomb rulers), https://www.distributed.net.
- [6]P. Duxbury, C. Lavor, L. L. de Salles-Neto, A conjecture on a continuous optimization model for the Golomb ruler problem, RAIRO Oper. Res. 55 (2021), 2241–2246, doi:10.1051/ro/2021103.DOI
- [7]P. Erdős, P. Turán, On a problem of Sidon in additive number theory, and on some related problems, J. London Math. Soc. 16 (1941), 212–215.
- [8]B. Kocuk, W.-J. van Hoeve, A computational comparison of optimization methods for the Golomb ruler problem, in: CPAIOR 2019, Lecture Notes in Computer Science, Springer (2019), 409–425, doi:10.1007/978-3-030-19212-9_27.DOI
- [9]R. Lorentzen, R. Nilsen, Application of linear programming to the optimal difference triangle set problem, IEEE Trans. Inform. Theory 37 (1991), 1486–1488.DOI
- [10]C. Meyer, B. Jaumard, Equivalence of some LP-based lower bounds for the Golomb ruler problem, Discrete Appl. Math. 154(1) (2006), 120–144.
- [11]M. B. Nathanson, Sidon sets with Δ-separated sumsets in additive number theory, arXiv:2608.07416 (2026).arxiv.org/abs/2608.07416
- [12]E. Notik, Positive dual certificates for real separated subset sums: chamber optimality of the Conway–Guy and Bohman sets, and exact values up to eight, arXiv:2611.17360 (2026); also doi:10.5281/zenodo.23399289.DOI
- [13]The On-Line Encyclopedia of Integer Sequences, sequences A003022 and A237749, https://oeis.org.
- [14]H. Ouzia, Partial reformulation-linearization based optimization models for the Golomb ruler problem, RAIRO Oper. Res. 58(4) (2024), 3171–3188, doi:10.1051/ro/2024121.DOI
- [15]I. Z. Ruzsa, Solving a linear equation in a set of integers, Acta Arith. 65 (1993), 259–282, doi:10.4064/aa-65-3-259-282.
- [16]J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc. 43 (1938), 377–385, doi:10.1090/S0002-9947-1938-1501951-4.DOI
- [17]HiGHS: high-performance software for linear optimization, version 1.15.1, https://highs.dev.