Searcharxiv⌕ Search

arXiv subjects

Esther Notik

Publications and source records attributed to Esther Notik.

2 recordsLinked to original sources

Golomb rulers with real marks: the real and integer optima agree up to ten marks

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 $G_R(n)$ of such a real ruler with $n$ marks is at most the optimal Golomb length $G_Z(n)$. 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 $G_R(n) = G_Z(n)$ for $n \le 10$. 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 $n \le 7$, and shows that there the shortest real rulers are exactly the optimal integer rulers and their mirror images. For every $n$ we show $n(\sqrt{n}-1)^2 \le G_R(n) \le G_Z(n)$, so that $G_R(n) \sim G_Z(n) \sim n^2$. Non-integral chamber vertices first appear at $n = 7$: 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.

math.CO↗

Positive Dual Certificates for Real Separated Subset Sums: Chamber Optimality of the Conway-Guy and Bohman Sets, and Exact Values up to Eight

Let $f_R(n)$ be the least possible largest element of a set of $n$ positive reals whose $2^n$ subset sums are pairwise at least 1 apart, and let $f_Z(n) \ge f_R(n)$ be the corresponding integer quantity of the Erdős distinct subset sums problem. Fixing the signs of all signed relations $\varepsilon\cdot x$, $\varepsilon \in \{-1,0,1\}^n$, decomposes the real problem into polyhedral chambers, on each of which it is a linear program. We prove that for every $n$ the Conway-Guy set is the unique optimum of its chamber. The proof is an explicit positive dual certificate consisting of $n$ signed relations that are tight at the Conway-Guy set and unit lower triangular in gap coordinates; the relations are described by blocks of consecutive coordinates together with the positions $n - k(k+1)/2$, and tightness reduces to an identity of the Conway-Guy sequence proved by induction. We then show, by a branch-and-bound over chambers in which every leaf carries an exact rational certificate, that $f_R(n) = f_Z(n)$ for all $n \le 8$; in particular $f_R(7) = 44$ and $f_R(8) = 84$. We then prove the same for both of Bohman's families, which first improve on Conway-Guy at $n = 12$ ($1159 < 1164$): every Bohman set is the unique optimum of its chamber, with a block-triangular certificate given by explicit formulas. Finally we exhibit chambers whose optimal vertex is not an integer point.

math.CO↗