Related papers: Collatz Conjecture: Patterns Within
Localized patterns are coherent structures embedded in a quiescent state and occur in both discrete and continuous media across a wide range of applications. While it is well-understood how domain covering patterns (for example stripes and…
In this paper, we show that if the numbers in the range $[1,2^n]$ satisfy Collatz conjecture, then almost all integers in the range $[2^n+1,2^{n+1}]$ will satisfy the conjecture as $n \to \infty$. The previous statement is equivalent to…
A curious observation was made that the rank statistics of scientific citation numbers follows Zipf-Mandelbrot's law. The same pow-like behavior is exhibited by some simple random citation models. The observed regularity indicates not so…
The Collatz conjecture, also known as the 3n+1 problem, is one of the most popular open problems in number theory. In this note, an algorithm for the verification of the Collatz conjecture is presented that works on a standard PC for…
A composition of an integer is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compsitions have been studied recently by Knopfmacher and Prodinger. We complement their work by establishing the…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
We investigate the following surprisingly widespread phenomenon which we call The Rule of Three: in order for a particular kind of commutation relation to hold for subsequences of elements of a ring labeled by any subset of indices, it is…
We study the synchronization of coupled dynamical systems on a variety of networks. The dynamics is governed by a local nonlinear map or flow for each node of the network and couplings connecting different nodes via the links of the…
Two conjectures are presented. The first, Conjecture 1, is that the pushforward of a geometric distribution on the integers under $n$ Collatz iterates, modulo $2^p$, is usefully close to uniform distribution on the integers modulo $2^p$, if…
A characteristic property of networks is their ability to propagate influences, such as infectious diseases, behavioral changes, and failures. An especially important class of such contagious dynamics is that of cascading processes. These…
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
We argue that the mathematical structure, enabling certain cascading and emergent phenomena to intuitively emerge, coincides with Galois connections. We introduce the notion of generative effects to formally capture such phenomena. We…
We study coming down from infinity for coordinated particle systems. In a coordinated particle system, particles live on a set of sites $V$ and are able to coalesce, migrate, reproduce, and die. The dynamics of these events are coordinated…
We study the non-equilibrium pattern formation that emerges when magnetically repelling colloids, trapped by optical tweezers, are abruptly released, forming colloidal explosions. For multiple colloids in a single trap we observe a pattern…
We define generalized Collatz mappings on free abelian groups of finite rank and study their iteration trajectories. Using geometric arguments we describe cones of points having a divergent trajectory and we deduce lower bounds for the…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot…
The possibility to study intermittency in a single event of high multiplicity is investigated in the framework of the $\alpha-$model. It is found that, for cascade long enough, the dispersion of intermittency exponents obtained from…
A chaotic system under periodic forcing can develop a periodically visited strange attractor. We discuss simple models in which the phenomenon, quite easy to see in numerical simulations, can be completely studied analytically.