ARAlexander Rahn

Alexander Rahn

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alexander Rahn has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Rotating Binaries

    by Anant Gupta, Idriss J. Aberkane, Sourangshu Ghosh, Adrian Abold, Alexander Rahn, Eldar Sultanow

    This paper investigates the behavior of rotating binaries. A rotation by r digits to the left of a binary number B exhibits in particular cases the divisibility l∣N1(B)·r+1, where l is the bit-length of B and N1(B) is the Hamming weight of B, that is the number of ones in B. The integer r is called the left-rotational distance. We investigate the connection between this rotational distance, the length, and the Hamming weight of binary numbers. Moreover, we follow the question under which circumstances the above-mentioned divisibility is true. We have found out and will demonstrate that this divisibility occurs for kn+c cycles.

  • Open Access

    An Algorithm for Linearizing the Collatz Convergence

    by Alexander Rahn, Eldar Sultanow, Max Henkel, Sourangshu Ghosh, Idriss J. Aberkane

    The Collatz dynamic is known to generate a complex quiver of sequences over natural numbers for which the inflation propensity remains so unpredictable it could be used to generate reliable proof-of-work algorithms for the cryptocurrency industry; it has so far resisted every attempt at linearizing its behavior. Here, we establish an ad hoc equivalent of modular arithmetics for Collatz sequences based on five arithmetic rules that we prove apply to the entire Collatz dynamical system and for which the iterations exactly define the full basin of attractions leading to any odd number. We further simulate these rules to gain insight into their quiver geometry and computational properties and observe that they linearize the proof of convergence of the full rows of the binary tree over odd numbers in their natural order, a result which, along with the full description of the basin of any odd number, has never been achieved before. We then provide two theoretical programs to explain why the five rules linearize Collatz convergence, one specifically dependent upon the Axiom of Choice and one on Peano arithmetic.


    • 14 July 2021
    • Published by HAL in HAL
    Open Access

    An algorithm for linearizing Collatz convergence

    by Alexander Rahn, Max Henkel, Sourangshu Ghosh, Eldar Sultanow, Idriss Aberkane, Idriss Jamil, Aberkane An Algo- Rithm

    The Collatz dynamic is known to generate a complex quiver of sequences over natural numbers which inflation propensity remains so unpredictable it could be used to generate reliable proof of work algorithms for the cryptocurrency industry; it has so far resisted every attempt at linearizing its behavior. Here we establish an ad hoc equivalent of modular arithmetic for Collatz sequences, based on five arithmetic rules we prove apply on the entire Collatz dynamical system and which iteration exactly define the full basin of attraction leading to any odd number. We further simulate these rules to gain insight on their quiver geometry and computational properties, and observe they allow to linearize the proof of convergence of the full rows of the binary tree over odd numbers in their natural order, a result which, along with the full description of the basin of any odd number, has never been achieved before. We then provide two theoretical programs to explain why the five rules allow to linearize Collatz convergence, one in ZFC and one in Peano arithmetic.