On the Bounds of Stopping and Cycle Numbers in the Collatz Process

We study the stopping time and cycle structure of the normalized Collatz iteration using a binary sequence formalism. By introducing a recursive rooted sequence tree by Winkler (2017), we establish a bijection between admissible binary sequences and integers $m \equiv 3 \pmod{4}$, showing that every