Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
External research report
Data sources: ZENODO
addClaim

Three-Block Mechanical Families and p-Adic Levers in the Collatz Carry Equation

Authors: De Jesus, Elias;

Three-Block Mechanical Families and p-Adic Levers in the Collatz Carry Equation

Abstract

We extend the finite-block obstruction mechanism of the archived two-block notes [7, 9] tothree-block mechanical families D(ϕ,ψ,ω)a,b,c = U aϕ V bψ W cω in the accelerated odd-only Collatz cycleequation. The two-block master interpolation identity generalizes to an exact telescopingidentity among the three pure-block constants, and wall contact becomes a four-monomialexponential Diophantine equation in which only the two extreme coefficients involve thecycle seed m. Extreme 2-adic and 3-adic levers therefore survive, with the same singlequoted two-logarithm irrationality measure (Rhin, as used by Simons–de Weger) controllingthe endpoint defect ∆ = L log2 3 − S independently of block count. A new phenomenonappears at three blocks: wall contacts of known cycles can form infinite resyllabificationlines rather than isolated points, the key example being (1, 2, 1)(2, 1)b(2) = (1, 2)b+2, a lineof −5 contacts. Two exact lemmas tame this: a power-reduction principle (Q(P r ) = Q(P ),so imprimitive contacts reduce to shorter, already-classified words) and a resyllabification-line criterion. A theorem-grade sweep then exhausted a finite-depth dataset of 8 families and74 phase triples to exact thresholds with no budget caps: 4,871,267 critical-core memberswere checked exactly, with zero unresolved triples, zero primitive contacts, and all contactslying on the known −5 line. The theorem applies to the tested finite-depth dataset only; itdoes not prove the Collatz conjecture, does not classify all three-block families, and does notconstrain positive-entropy words.

Powered by OpenAIRE graph
Found an issue? Give us feedback