Related papers: Almost all orbits of the Collatz map attain almost…

We develop the general non-equilibrium theory of transport through a quantum dot, including Coulomb Blockade effects via a 1/N expansion, where N is the number of scattering channels. At lowest order we recover the Landauer formula for the…

This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…

The Nielsen number $N(f)$ is a lower bound for the minimal number of fixed points among maps homotopic to $f$. When these numbers are equal, the map is called Wecken. A recent paper by Brimley, Griisser, Miller, and the second author…

Let p be a prime, and let f : Z/pZ -> R be a function with average value 0 and ||f||_A <= 1, where ||f||_A denotes the algebra norm (L^1 norm of the Fourier transform). Then f(x) is small for some x, specifically min_x |f(x)| is no more…

We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…

The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Let $x_i$, $i\in\mathbb{Z}$ be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz $\mathbf{X}=\left(x_{j-i}\right)_{1\leq i\leq p,1\leq j\leq n}$ and circulant $\mathbf{X}=\left(x_{(j-i)\mod…

In this paper, we study abstract dynamical systems with discrete phase spaces. One example of such a system is induced by the $3 x{+}1$-map on the set of all natural numbers, also known as the Collatz map. Our main focus is on dynamical…

For a continuous map $f$ from the real line (half-open interval $[0,1)$) into itself let ent(f) denote the supremum of topological entropies of $f|_K$, where $K$ runs over all compact $f$-invariant subsets of $\mathbb{R}$ ($[0,1)$,…

In this research, an optimal algorithm for the Collatz conjecture is presented. Properties such as the convergence of the algorithm and an equation that relates the algorithm to the classical Collatz conjecture are obtained. It is validated…

Let X be a Noetherian space, let f be a continuous self-map on X, let Y be a closed subset of X, and let x be a point on X. We show that the set S consisting of all nonnegative integers n such that f^n(x) is in Y is a union of at most…

In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…

We extend the variational approach to regularity for optimal transport maps initiated by Goldman and the first author to the case of general cost functions. Our main result is an $\epsilon$-regularity result for optimal transport maps…

Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to…

Contraction properties of transport maps between probability measures play an important role in the theory of functional inequalities. The actual construction of such maps, however, is a non-trivial task and, so far, relies mostly on the…

We show that if the minimum entropy for a polynomial with roots on the unit circle is attained by polynomials with equally spaced roots, then, under a generic hypothesis about the nature of the extremum, the Krzyz conjecture on the maximum…

Let $P\in\mathbb{P}_1(\mathbb{Q})$ be a periodic point for a monic polynomial with coefficients in $\mathbb{Z}$. With elementary techniques one sees that the minimal periodicity of $P$ is at most $2$. Recently we proved a generalization of…

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…

Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…