NOTA TÉCNICA — CONJECTURA MÖBIUS X FINITUDE DE SIMETRIA
Description
We compare two pairing functions on the discrete 5-bit domain [0, 31], represented as the conventional base-32 binary list (notation NC, 00000 to 11111): the bit-order reversal R(x) (Möbius model) and f(x) = 31 − x (Symmetry Finiteness / Folding Effect, equivalent to bitwise NOT). Both are validated through a Hamming valuation, using the distance d_H(x, g(x)) between each element and its pair. Three criteria are tested: involution, complementarity (d_H = 5) and absence of fixed points (d_H > 0). Both functions are involutions (32/32). Only f attains the maximum distance d_H = 5 in all 32 cases, which is equivalent to the constant sum x + f(x) = 31 and leaves no fixed points. R yields d_H ∈ {0, 2, 4}, never 5, with mean 2 and 8 fixed points (the binary palindromes). A parity argument shows that complementarity under R is impossible. Complementarity, not involutivity, separates the two models.
Files
Files
(17.9 kB)
| Name | Size | |
|---|---|---|
|
md5:87c49464f8501ab163fb5090cb2f5cb5
|
17.9 kB | Download |
Additional details
Dates
- Accepted
-
2026-10-03