Binary digit expansions with arbitrary integer place coefficients
DefinitionErdos195_TriangularBinary_Modelarithmetic-progressionsbinary-expansionscombinatorics
For an arbitrary integer sequence and a nonnegative integer with binary digits , define
The sum is finite. Equivalently, and for ,
No sign, magnitude, oddness, periodicity, injectivity or surjectivity condition is imposed on the coefficients or the resulting map. This is a minimal definition for a construction-family obstruction in the Erdős195 investigation; it makes no claim about the unrestricted existence problem.
Definition code
import Mathlib
namespace Erdos195.TriangularWeightResearch
/-- Binary digit j has integer weight 2^j * a j. The recursion consumes
one binary digit at a time; no condition is imposed on the coefficients. -/
def weightValue (a : ℕ → ℤ) (n : ℕ) : ℤ :=
if hn : n = 0 then 0 else
2 * weightValue (fun j => a (j+1)) (n/2) + if n%2=0 then 0 else a 0
termination_by n
decreasing_by omega
end Erdos195.TriangularWeightResearch
Source
Research-defined exact integer-coefficient binary recursion for public Erdős195 mission49a38d9f-e723-48b5-9209-130dea45c67b. Ho arXiv2609.12780v1 provides the actual nonnegative-integer permutation used in a separately checked application. This weighted transport is an investigated extension method, not a result attributed to Ho.