Answers are grounded in this paper and cite their sources.
The six-element set Bit+ = {0, 1, 2, 3, 5, 8} is a lacunary extraction from the Fibonacci sequence, obtained by deduplicating F(1) = F(2) = 1 and truncating at F(6) = 8. We prove three results. First, Bit+ is characterized as a lacunary subset by the truncation at the smallest n for which F(n+1) exceeds twice the running sum (the Fibonacci overflow criterion). Second, the pairwise difference set of Bit+ achieves exactly twice the unique-baseline count of uniform spacing at the same cardinality (extremal non-redundancy). Third, the scaling identity 7 × Σ(Bit+) = 7 × 19 = 133 = dim(e7) holds, connecting the subset sum to the dimension of the exceptional Lie algebra e7 through the multiplier 7 = rank(E7). This identity is proved; it is not a conjecture.
No takes yet. Share an insight, caveat, or question.
Robert A. Kenney (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: