Related papers: Rich dynamical behaviors from a digital reversal o…
Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…
Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighborhood of the origin. We address this question in…
Kaprekar's Routine is an iteration process that, with each iteration, sorts the digits of a number in descending and ascending orders and uses their difference for the next iteration. In this paper, we successfully address the structure of…
We investigate continuous regularization methods for linear inverse problems of static and dynamic type. These methods are based on dynamic programming approaches for linear quadratic optimal control problems. We prove regularization…
Many real-world optimisation problems involve dynamic and stochastic components. While problems with multiple interacting components are omnipresent in inherently dynamic domains like supply-chain optimisation and logistics, most research…
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…
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…
Stochastic differential equations can describe a wide range of dynamical systems, and obtaining the governing equations of these systems is the premise of studying the nonlinear dynamic behavior of the system. Neural networks are currently…
We determine all pairs of positive integers $(a,b)$ such that $a+b$ and $a \times b$ have the same decimal digits in reverse order: \[ (2,2), (9,9), (3,24), (2,47), (2,497), (2,4997), (2,49997), \ldots \] We use deterministic finite…
The dynamics of the family of maps $\displaystyle{f_{\alpha, \beta, \gamma, \delta}(z)=\frac{\alpha z + \beta}{\gamma z^2 +\delta z}}$ in complex plane is investigated computationally. This dynamical system $z_{n+1}=f_{\alpha, \beta,…
The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…
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,…
The Collatz problem is generalized into $3n + 3^k$ problem. It is shown that as long as the Collatz function iterates converge to the cycle passing through the number 1, the $3n + 3^k$ sequence converges to the cycle passing through the…
Kaprekar's routine, i.e., sorting the digits of an integer in ascending and descending order and subtracting the two, defines a finite deterministic map on the state space of fixed-length digit strings. While its attractors (such as 495 for…
Taking the absolute value of consecutive differences of a cyclicly ordered list of integers constitutes a simple dynamical system. For lists of lenght a power of two the process will terminate in all zeros, but examples with arbitarily long…
We study spatial discretizations of dynamical systems: is it possible to recover some dynamical features of a system from numerical simulations? Here, we tackle this issue for the simplest algorithm possible: we compute long segments of…
We consider convex optimization problems formulated using dynamic programming equations. Such problems can be solved using the Dual Dynamic Programming algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…