English
Related papers

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

200 papers

We characterize all pairs of completely multiplicative functions $f,g:\mathbb{N}\to\mathbb{T}$ such that the orbit closure \[\overline{\{(f(n),g(n+1))\}_{n\ge 1}} \neq \mathbb{T}\times \mathbb{T}.\] In so doing, we settle an old conjecture…

Number Theory · Mathematics 2020-03-18 Oleksiy Klurman , Alexander P. Mangerel

The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…

Dynamical Systems · Mathematics 2012-04-23 Keenan Monks , Kenneth G. Monks , Kenneth M. Monks , Maria Monks

For each $d \in {1,2,3,7,11}$, let $T_d$ be the nearest-integer complex continued fraction map associated with the Euclidean ring $\mathcal{O}*d$, and let $(a_n)$ be its digit sequence. We prove two metric results for this five-system…

Dynamical Systems · Mathematics 2026-04-17 Kangrae Park

It is believed that, in the limit as the conductor tends to infinity, correlations between the zeros of elliptic curve $L$-functions averaged within families follow the distribution laws of the eigenvalues of random matrices drawn from the…

Number Theory · Mathematics 2008-11-17 D. K. Huynh , J. P. Keating , N. C. Snaith

The Collatz problem with $3x+k$ is revisited. Positive and negative limit cycles are given up to k=9997 starting with $x_0=-2\cdot10^7...+2\cdot10^7$. A simple relation between the probability distribution for the Syracuse iterates for…

Dynamical Systems · Mathematics 2021-01-21 Franz Wegner

A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over…

Combinatorics · Mathematics 2014-09-16 Cong X. Kang

The $3x+1$ problem, also called the Collatz conjecture, is a very interesting unsolved mathematical problem related to computer science. This paper generalized this problem by relaxing the constraints, i.e., generalizing this deterministic…

Computational Complexity · Computer Science 2013-11-25 Bojin Zheng , Yangqian Su , Hongrun Wu , Li Kuang

We study an analogue of the Collatz map in the polynomial ring $R[x]$, where $R$ is an arbitrary commutative ring. We prove that if $R$ is of positive characteristic, then every polynomial in $R[x]$ is eventually periodic with respect to…

Combinatorics · Mathematics 2024-10-01 Angelot Behajaina , Elad Paran

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…

General Mathematics · Mathematics 2024-06-12 Jishe Feng

Assume that $X$ is a Banach space of measurable functions for which Koml\'os' Theorem holds. We associate to any closed convex bounded subset $C$ of $X$ a coefficient $t(C)$ which attains its minimum value when $C$ is closed for the…

Functional Analysis · Mathematics 2017-09-12 T. Domínguez Benavides , M. A , Japón

We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We…

Number Theory · Mathematics 2026-02-12 Vigleik Angeltveit

We investigate the small regularization limit of entropic optimal transport when the cost function is the Euclidean distance in dimensions $d > 1$, and the marginal measures are absolutely continuous with respect to the Lebesgue measure.…

Probability · Mathematics 2025-08-15 Shrey Aryan , Promit Ghosal

This paper explores the problem of analytically approximating the orbital state for a subset of orbits in a rotating potential with oblateness and ellipticity perturbations. This is done by isolating approximate differential equations for…

Earth and Planetary Astrophysics · Physics 2022-02-02 Ethan Burnett , Hanspeter Schaub

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

Rademacher's Theorem can be interpreted as an almost-everywhere \emph{little-$o$ improvement principle}: if a function admits a uniform pointwise first-order Lipschitz control at every point, then this control improves to a vanishing one at…

Functional Analysis · Mathematics 2026-02-10 Thomas Lamby

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

Combinatorics · Mathematics 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

Let $-1<\lambda<1$ and $f:[0,1)\to\mathbb{R}$ be a piecewise $\lambda$-affine map, that is, there exist points $0=c_0<c_1<\cdots <c_{n-1}<c_n=1$ and real numbers $b_1,\ldots,b_n$ such that $f(x)=\lambda x+b_i$ for every $x\in…

Dynamical Systems · Mathematics 2022-02-02 Arnaldo Nogueira , Benito Pires , Rafael A. Rosales

Let $n\geq 3$ and let $\Omega \subset \mathbb{R}^n$ be a $\mathcal{C}^1$ bounded domain which is diffeomorphic to a ball. We investigate here the problem of finding critical points of the $n$-energy in the space $\mathcal{I}=\{v\in…

Analysis of PDEs · Mathematics 2026-05-28 Dorian Martino , Katarzyna Mazowiecka , Rémy Rodiac

For each $n, d \in \mathbb{N}$ and $0 < \alpha < 1$, we define a random subset of $\mathcal{A}^{\{1, 2, \dots, n\}^d}$ by independently including each element with probability $\alpha$ and excluding it with probability $1-\alpha$, and…

Dynamical Systems · Mathematics 2016-11-17 Ryan Broderick

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

Number Theory · Mathematics 2025-04-22 Ameneh Farhadian