Related papers: Encoding and Visualization in the Collatz Conjectu…

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

I investigate structural limitations of Presburger-arithmetic-based approaches to the Collatz problem. I show that the Collatz cycle equation admits a unique solution in the $2$-adic integers, which I term a \emph{ghost cycle}. These ghost…

We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…

Let $q$ be an odd prime, and let $T_{q}:\mathbb{Z}\rightarrow\mathbb{Z}$ be the Shortened $qx+1$ map, defined by $T_{q}\left(n\right)=n/2$ if $n$ is even and $T_{q}\left(n\right)=\left(qn+1\right)/2$ if $n$ is odd. The study of the dynamics…

The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single…

The infamous 3x+1 conjecture spread by Lothar Collatz in 1952, despite its elementary formulation, remained unproved for over 60 years. From the heuristical probabilistic approach to the complex mapping of the algorithm, the scientific…

We introduce an explicit logarithmic transformation $T(x) = \{\log_6(x + 1/5)\}$ under which the Collatz map becomes a rigid circle rotation by the irrational angle \(\alpha = \log_6 3\), perturbed by a uniformly bounded error term. We…

Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…

The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…

In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…

The cluster structures that can be observed in the first few level sets of the Collatz tree are maintained through all its levels, provided that the orbit steadiness \[ \prod_{\substack{k \in R(n)\\ k \equiv 4\ (\mathrm{mod}\ 6)}}…

For applications in computing, Bezier curves are pervasive and are defined by a piecewise linear curve L which is embedded in R^3 and yields a smooth polynomial curve C embedded in R^3. It is of interest to understand when L and C have the…

We investigate the structure of Collatz path sequences $\{F^k(n)\}_{k=0}^{\infty}$ for positive integers $n$, where $F$ denotes the standard Collatz map. By classifying natural numbers into residue classes modulo~4, we establish that the…

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…

In the past 20 years, compactifications of the families of curves in algebraic varieties X have been studied via stable maps, Hilbert schemes, stable pairs, unramified maps, and stable quotients. Each path leads to a different enumeration…

We introduce the \emph{Collatz conjecture} and its history. Some definition that this conjecture has, will be expressed and with these we try to explain some good lemma to justify the main properties of the \emph{Collatz conjecture}. With…

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…

In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain second-stage costs. The computational complexity of this problem…

The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…