Collatz Sequences in the Light of Graph Theory

  • The Collatz conjecture is a number theoretical problem, which has puzzled countless researchers using myriad approaches. Presently, there are scarcely any methodologies to describe and treat the problem from the perspective of the Algebraic Theory of Automata. Such an approach is promising with respect to facilitating the comprehension of the Collatz sequence’s "mechanics". The systematic technique of a state machine is both simpler and can fully be described by the use of algebraic means. The current gap in research forms the motivation behind the present contribution. The present authors are convinced that exploring the Collatz conjecture in an algebraic manner, relying on findings and fundamentals of Graph Theory and Automata Theory, will simplify the problem as a whole.

Download full text files

Export metadata

Metadaten
Author:Eldar SultanowORCiDGND, Christian Koch, Sean Cox
URN:urn:nbn:de:kobv:517-opus4-437416
DOI:https://doi.org/10.25932/publishup-43741
Document Type:Preprint
Language:English
Date of first Publication:2019/11/05
Year of Completion:2019
Publishing Institution:Universität Potsdam
Release Date:2019/11/05
Tag:Cayley Graph; Collatz; Free Group; Reachability
Edition:2nd version
Pagenumber:21
Organizational units:Wirtschafts- und Sozialwissenschaftliche Fakultät / Wirtschaftswissenschaften
MSC Classification:11-XX NUMBER THEORY
Collections:Universität Potsdam / Sondersammlungen / Collatz Sequences in the Light of Graph Theory / Second Version
Licence (German):License LogoCreative Commons - Namensnennung, 4.0 International