Related papers: Dynamique du probl\`eme $3x+1$ sur la droite r\'ee…
Collatz Conjecture (also known as Ulam's conjecture and 3x+1 problem) concerns the behavior of the iterates of a particular function on natural numbers. A number of generalizations of the conjecture have been subjected to extensive study.…
The search for new integrable (3+1)-dimensional partial differential systems is among the most important challenges in the modern integrability theory. It turns out that such a system can be associated to any pair of rational functions of…
For any positive integer $n$, define an iterated function $$ f(n)=\left\{\begin{array}{ll} n/2, & \mbox{$n$ even,} \\ 3n+1, & \mbox{$n$ odd.} \end{array} \right. $$ Suppose $k$ (if it exists) is the lowest number such that $f^{k}(n)<n$, and…
Paul Erdos claimed that mathematics is not yet ready to settle the 3x+1 conjecture. I agree, but very soon it will be! With the exponential growth of computer-generated mathematics, we (or rather our silicon brethrern) would have a shot at…
We introduce a growth process which samples sections of uniform infinite causal triangulations by elementary moves in which a single triangle is added. A relation to a random walk on the integer half line is shown. This relation is used to…
This paper studies certain trajectories of the Collatz function. I show that if for each odd number $n$, $n\sim 3n+2$ then every positive integer $n \in \mathbb{N}\setminus 2^{\mathbb{N}}$ has the representation…
I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.
In this work, we introduce multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms. We give a multiplicative version of the classical drift theorem. This allows…
We introduce a discrete dynamical system on the integers, defined by moving a composite $m$ forward to $m+\pi(m)$ and a prime $p$ backward to $p-\mathrm{prevprime}(p)$. This map produces trajectories whose contraction properties are closely…
The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…
This paper develops a continuous-time primal-dual accelerated method with an increasing damping coefficient for a class of convex optimization problems with affine equality constraints. This paper analyzes critical values for parameters in…
Anderson transition in three-dimensional systems is investigated using renormalization group theory. $\beta$-function of a very simple form is derived from a self-consistent consideration, and it gives a value $1+1/\sqrt{3}=1.58$ for the…
This paper gives a simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the $3x+1$ problem (see \cite{Wirsching} and \cite{Goodwin}). This representation permits to compute all the ascending Collatz sequences…
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…
Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully…
The (3x+1)-Map, T, acts on the set, Pi, of positive integers not divisible by 2 or 3. It is defined by T(x) = (3x+1)/2^k, where k is the largest integer for which T(x) is an integer. The (3x+1)-Conjecture asks if for every x in Pi there…
We establish global convergence of the (1+1) evolution strategy, i.e., convergence to a critical point independent of the initial state. More precisely, we show the existence of a critical limit point, using a suitable extension of the…
We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according…
In this note, we provide an overarching analysis of primal-dual dynamics associated to linear equality-constrained optimization problems using contraction analysis. For the well-known standard version of the problem: we establish…
I present a covariant approach to developing 1+3 formalism without an introduction of any basis or coordinates. In the formalism, a spacetime which has a timelike congruence is assumed. Then, tensors are split into temporal and spatial…