A Critical Backward Tree for x ↦ round(4x/5)

We study the map f(x) = round(4x/5) on the positive integers and its backward tree, in which multiples of 5 are forbidden. Each integer has one or two preimages under f, on average 5/4, and a preimage avoids multiples of 5 with frequency 4/5; the mean number of surviving children is therefore exactly 1, so the tree behaves heuristically like a critical branching process. The branching is governed exactly by residues modulo 4: nodes divisible by 4 have no surviving child. Computations support the heuristic: every tree with root below 10,000 dies, but the extinction depths have a long tail (the tree rooted at 306 dies at depth 39,858, the tree rooted at 1013 at depth 11,603). By contrast, if rounding is replaced by the floor function, the backward tree coincides with the rational base tree T_{5/4} of Akiyama, Frougny and Sakarovitch, and the same constraint leaves exactly one infinite path, which we prove in a few lines. We state the conjecture that every tree of the rounding version dies, and we place the problem next to the Collatz, Mahler 3/2 and Antihydra problems. No proof of the conjecture is offered.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24382913
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Critical Backward Tree for x ↦ round(4x/5)

Tak Heung Sze
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
preprint

A Critical Backward Tree for x ↦ round(4x/5)

Tak Heung Sze
preprint en

Abstract

We study the map f(x) = round(4x/5) on the positive integers and its backward tree, in which multiples of 5 are forbidden. Each integer has one or two preimages under f, on average 5/4, and a preimage avoids multiples of 5 with frequency 4/5; the mean number of surviving children is therefore exactly 1, so the tree behaves heuristically like a critical branching process. The branching is governed exactly by residues modulo 4: nodes divisible by 4 have no surviving child. Computations support the heuristic: every tree with root below 10,000 dies, but the extinction depths have a long tail (the tree rooted at 306 dies at depth 39,858, the tree rooted at 1013 at depth 11,603). By contrast, if rounding is replaced by the floor function, the backward tree coincides with the rational base tree T_{5/4} of Akiyama, Frougny and Sakarovitch, and the same constraint leaves exactly one infinite path, which we prove in a few lines. We state the conjecture that every tree of the rounding version dies, and we place the problem next to the Collatz, Mahler 3/2 and Antihydra problems. No proof of the conjecture is offered.

Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon