Alexander Rahn
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
Research Subjects
Alexander Rahn has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Eldar Sultanow
Business Informatics, Processes and Systems, University of Pots dam, Karl-Marx-Straße 67, 14482 Potsdam, Germany, Germany
3 shared publications - Idriss J. Aberkane
Unesco-Unitwin Complex Systems Digital Campus, ECCE e-Lab, CEDEX, 67081 Strasbourg, France
3 shared publications - Sourangshu Ghosh
Indian Institute of Science Bangalore, India
3 shared publications Aberkane An Algo- Rithm
1 shared publication- Adrian Abold
Department of EEI, Friedrich-Alexander-Universität Erlangen-Nürnberg, Lange Gasse 20, 90403 Nuremberg, Germany
1 shared publication - Anant Gupta
College of Computing, Georgia Institute of Technology, Atlanta, GA, USA
1 shared publication
Latest Publications
- Open Access
- 3 February 2022
- Published by MDPI AG in AppliedMath
- Vol. 2 (1) , 104-117
Rotating Binaries
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 , where l is the bit-length of B and 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 cycles.- 3 February 2022
- Published by MDPI AG in AppliedMath
- Vol. 2 (1) , 104-117
Open AccessRotating Binaries
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 , where l is the bit-length of B and 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 cycles. - Open Access
- 9 August 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (16) , 1898
An Algorithm for Linearizing the Collatz Convergence
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.
- 9 August 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (16) , 1898
Open AccessAn Algorithm for Linearizing the Collatz Convergence
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.
- Open Access
An algorithm for linearizing Collatz convergence
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.
Open AccessAn algorithm for linearizing Collatz convergence
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.