Related papers: Collatz Cycles and $3n+c$ Cycles

I investigate structural limitations of Presburger-arithmetic-based approaches to the Collatz problem. I show that the Collatz cycle equation admits a unique solution in the $2$-adic integers, which I term a \emph{ghost cycle}. These ghost…

We study the Abel differential equation x0 = A(t)x3 + B(t)x2 +C(t)x. Specifically, we find bounds on the number of its rational solutions when A(t), B(t) and C(t) are polynomials with real or complex coefficients; and on the number of…

In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…

We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lov\'{a}sz from 1969 and Thomassen from 1978, respectively, states that all connected vertex-transitive graphs…

Let as usual $Z(t) = \zeta(1/2+it)\chi^{-1/2}(1/2+it)$ denote Hardy's function, where $\zeta(s) = \chi(s)\zeta(1-s)$. Assuming the Riemann hypothesis upper and lower bounds for some integrals involving $Z(t)$ and $Z'(t)$ are proved. It is…

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

The purpose of this paper is to show three general formulas of three global characteristic coefficients of Collatz function. The Collatz function is defined by the following operation on an arbitrary positive integer if N is odd multiply it…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

We show that every $k$-uniform hypergraph on $n$ vertices whose minimum $(k-2)$-degree is at least $(5/9+o(1))n^2/2$ contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The…

Let $D(x_1, x_2, ..., x_n)=(x_1+x_2 \;\text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m)$ where $D \in End(\mathbb{Z}_m^n)$ be the Ducci function. The sequence $\{D^k(\mathbf{u})\}_{k=0}^{\infty}$ will eventually…

We prove that, for every natural number $k$, every sufficiently large 3-connected cubic planar graph has a cycle whose length is in $[k,2k+9]$. We also show that this bound is close to being optimal by constructing, for every even $k\geq…

We introduce a class of Boltzmann equations on the real line, which constitute extensions of the classical Kac caricature. The collisional gain operators are defined by smoothing transformations with quite general properties. By…

There are natural actions of the braid groups on the products of the braid groups, called the Hurwitz action. We first study the roots of centralizers in the braid groups. By using the structure of the roots, we provide a criterion for the…

We obtain a complete characterization of all orbits of a quadratic Collatz-type recursion called the divide-or-choose-2 rule. Each orbit either ends in a cycle whose period depends on the initial value or it goes to infinity. We specify…

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 tight Hamilton cycle in a $k$-uniform hypergraph ($k$-graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms an edge. R\"{o}dl, Ruci\'{n}ski, and Szemer\'{e}di proved…

Let G be a group acting on a tree with cyclic edge and vertex stabilizers. Then stable commutator length (scl) is rational in G. Furthermore, scl varies predictably and converges to rational limits in so-called "surgery" families. This is a…

We introduce a renormalization procedure which allows us to study in a unified and concise way different properties of the irrational rotations on the unit circle $\beta \mapsto \set{\alpha+\beta}$, $\alpha \in \R\setminus \Q$. In…

In this paper, the global qualitative analysis of planar quadratic dynamical systems is established and a new geometric approach to solving Hilbert's Sixteenth Problem in this special case of polynomial systems is suggested. Using geometric…

In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…