Comportamento de livre escala nas sequências de hailstone usando o mapa de Collatz
The Collatz conjecture, perhaps the most elementary unsolved problem in mathematics, claims that for all positive integers n, the map n 7→ n/2 for even n and n 7→ 3n+1 for odd n reaches 1 after a nite number of iterations. We examine the Collatz map's orbits, known as hailstone sequences, and...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | doctoralThesis |
| Idioma: | pt_BR |
| Publicado em: |
Universidade Federal do Rio Grande do Norte
|
| Assuntos: | |
| Endereço do item: | https://repositorio.ufrn.br/handle/123456789/44909 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| Resumo: | The Collatz conjecture, perhaps the most elementary unsolved problem in mathematics, claims that for all positive integers n, the map n 7→ n/2 for even n and n 7→ 3n+1 for
odd n reaches 1 after a nite number of iterations. We examine the Collatz map's orbits,
known as hailstone sequences, and ask whether or not they exhibit scale-invariant behavior, in analogy with certain processes observed in real physical systems. We develop an
e cient way to generate orbits for extremely large n's (e.g., higher than n ≈ 103,000), allowing to statistically analyze very long sequences. We nd strong evidence of a scale-free
power law for the Collatz map. We analytically derive the scaling exponents, displaying excellent agreement with the numerical estimations. The scale-free sequences seen in
the Collatz dynamics are consistent with geometric Brownian motion with drift, which is
compatible with the validity of the Collatz conjecture. Our results lead to another conjecture (conceivably testable through direct, nonetheless very time consuming, numerical
simulations): given an initial n, the average number of iterations needed to reach 1 is
proportional, to lowest order, to log[n]. |
|---|