Skip to content
DraconiticResearch
Search Sources API
203,952 studies31 sourcesUpdated 27 min ago
PreprintCC BY 4.0Zenodo

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

  • Esther Notik1
  1. 1Independent researcher
Open at sourcePDFDOICite

Abstract

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) ≥ f_R(n) be the corresponding integer quantity of the Erdős distinct subset sums problem.

Fixing the signs of all signed relations ε·x, ε ∈ {−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 ≤ 8; in particular f_R(7) = 44 and f_R(8) = 84. We also prove chamber optimality 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.

Related

  1. Heilbronn's Problem in the Unit Triangle: Computational Optimality Certificates for n ≤ 8
    Nathan Sudermann-Merx
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  2. The Rytova-Keldysh interaction is a positive Gaussian mixture: kernel-checked admissibility for planar universal optimality and Keldysh-jellium Madelung energies of TMD Wigner lattices
    Xavier Callens
    ZenodoPreprintCC BY 4.0Full textZenodo
  3. The Rytova-Keldysh interaction is a positive Gaussian mixture: kernel-checked admissibility for planar universal optimality and Keldysh-jellium Madelung energies of TMD Wigner lattices
    Xavier Callens
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY9 citedNumerical analysis & scientific computingOpenAlex
  4. Preliminary structural design of the IDEA drift chamber
    Mauro Corrado, Giorgio Zavarise, Rakesh Rawat +1
    Nuclear Physics BPeer-reviewedCC BY 4.0Full textHigh-energy & particle physicsCrossref
  5. Heat Transfer Performance of Circular Ultra-Thin Vapor Chamber with Superhydrophilic Patterned Microstructure for LED Lamp Cooling
    Tengqing Liu, Yaokang Zhang, Yaoxun Feng +2
    MicromachinesPeer-reviewedCC BYFull textEurope PMC

Cite

BibTeXRIS
BibTeX
@misc{notik2026positive,
  title = {{Positive Dual Certificates for Real Separated Subset Sums: Chamber Optimality of the Conway–Guy and Bohman Sets, and Exact Values up to Eight}},
  author = {Esther Notik},
  howpublished = {Zenodo},
  year = {2026},
  month = oct,
  doi = {10.5281/zenodo.23647845},
  url = {https://zenodo.org/records/23647845},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Positive Dual Certificates for Real Separated Subset Sums: Chamber Optimality of the Conway–Guy and Bohman Sets, and Exact Values up to Eight
AU  - Esther Notik
PY  - 2026
DA  - 2026/10/25
PB  - Zenodo
DO  - 10.5281/zenodo.23647845
UR  - https://zenodo.org/records/23647845
AB  - 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) ≥ f_R(n) be the corresponding integer quantity of the Erdős distinct subset sums problem.  Fixing the signs of all signed relations &epsilon;·x, &epsilon; &isin; {−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 ≤ 8; in particular f_R(7) = 44 and f_R(8) = 84. We also prove chamber optimality 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.
ER  -