English

Carryless Pairing: Additive Pairing in the Fibonacci Basis

Logic 2026-05-12 v5 Logic in Computer Science

Abstract

We define a pairing map πCL:N2N\pi_{\mathsf{CL}} : \mathbb{N}^2\to\mathbb{N} that encodes xx and yy into two disjoint bands of Zeckendorf indices separated by a delimiter computed from xx. The construction is "carryless" by design: the combined support has no consecutive indices, so each produced code is already in Zeckendorf-normal form, and both evaluation and inversion proceed by additive support operations alone, without multiplication, factorization, or positional digit interleaving. The map is injective not surjective, image membership is decidable by the same support machinery used for decoding. The core correctness theorems are mechanized in Rocq.

Keywords

Cite

@article{arxiv.2509.10382,
  title  = {Carryless Pairing: Additive Pairing in the Fibonacci Basis},
  author = {Milan Rosko},
  journal= {arXiv preprint arXiv:2509.10382},
  year   = {2026}
}

Comments

Theoretical paper in mathematical logic and bounded arithmetic, 11 pages, 4 figures. Establishes an additive arithmetic pairing function. The core claims are mechanized in Rocq

R2 v1 2026-07-01T05:33:45.216Z