相关论文: On the orbits associated with the Collatz conjectu…
Consider a finite positive integer. If it is even, divide it by 2, and if it is odd, multiply it by 3 and add 1. This will give you a new integer. Following the procedure for the new integer, you will receive another integer. Repeat the…
We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…
We prove a conjecture by D. Zeilberger on the determinant of a certain matrix and relate it to a problem of non-existence of 1-cycles in this note.
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
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…
We know that $\mathbb{Z}_n$ is a finite field for a prime number $n$. Let $m,n$ be arbitrary natural numbers and let $\mathbb{Z}^m_n= \mathbb{Z}_n \times\mathbb{Z}_n\times...\times\mathbb{Z}_n$ be the Cartesian product of $m$ rings…
The stability and the basin of attraction of a periodic orbit can be determined using a contraction metric, i.e., a Riemannian metric with respect to which adjacent solutions contract. A contraction metric does not require knowledge of the…
After analyzing the 4x4 determinant of a matrix, a shortcut was obtained to find such a determinant. Similarly to the Sarrus method for 2x2 or 3x3 determinants, the method consists of laying 19 columns of size 4 each and adding and…
Inspired by work of McMullen, we show that any orbit for the action of the diagonal group on the space of lattices, accumulates on a stable lattice. We use this to settle a conjecture of Ramharter about Mordell's constant, get new proofs of…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
We extend the results of T. Giordano, I. F. Putnam, C. F. Skau contained in ``$\mathbb Z^d$-odometers and cohomology", Groups Geom. Dyn. 13 (2019), no. 3, P. 909-938, on characterization of conjugacy, isomorphism, and continuous orbit…
Define the \emph{Collatz map} $\mathrm{Col} : \mathbb{N}+1 \to \mathbb{N}+1$ on the positive integers $\mathbb{N}+1 = \{1,2,3,\dots\}$ by setting $\mathrm{Col}(N)$ equal to $3N+1$ when $N$ is odd and $N/2$ when $N$ is even, and let…
We describe a simple algorithm for classifying orbits into orbit families. This algorithm works by finding patterns in the sign changes of the principal coordinates. Orbits in the logarithmic potential are studied as an application; we…
The Orbit Problem asks whether the orbit of a point under a matrix reaches a given target set. When the target is a single point, the problem was shown to be decidable in polynomial time by Kannan and Lipton. This decidability result was…
We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a special case of a conjectured dynamical analogue of the Mordell-Lang…
In 1995, Meinardus & Berg presented a reformulation of the Collatz Conjecture in terms of a functional equation in a single complex variable over the open unit disk. This paper generalizes that method to deal with not only a large class of…
Motivated by numerous examples in the literature, we state a conjecture on the Hilbert series of Koszul symmetric operads generated by one element of arity $2$. We prove this conjecture for all Koszul symmetric set-operads generated by one…
McMullen '03 constructs a collection of orbits $\mathrm{SL}_2(\mathbb{R}).x$ in $\mathcal{H}(1,1)$ with infinitely generated stabilizers $\mathrm{stab}_{\mathrm{SL}_2(\mathbb{R})}(x)$. We prove a gap in the set of critical exponents of…
This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…