Related papers: A polynomial approach to the Collatz conjecture

We reduce the Nowicki conjecture on the Weitzenb\"ock derivation of polynomial algebras to well-known problem of the classical invariant theory.

In many applications of the probabilistic method, one looks to study phenomena that occur ``with high probability''. More recently however, in an attempt to understand some of the most fundamental problems in combinatorics, researchers have…

WITHDRAWN: The proof contains an uncorrectable gap in the proof of theorem 7 on page 11. A proof of the Krzyz conjecture is presented, based on the application of the variational method, as well as on the use of two classical results and…

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…

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…

The weak convergence of orthogonal polynomials is given under conditions on the asymptotic behaviour of the coefficients in the three-term recurrence relation. The results generalize known results and are applied to several systems of…

We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

The Collatz process is defined on natural numbers by iterating the map $T(x) = T_0(x) = x/2$ when $x\in\mathbb{N}$ is even and $T(x)=T_1(x) =(3x+1)/2$ when $x$ is odd. In an effort to understand its dynamics, and since Generalised Collatz…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

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…

In this paper, we prove that reduced dynamics on Collatz conjecture is periodical, and its period equals 2 to the power of the count of x/2 computation in the reduced dynamics. More specifically, if there exists reduced dynamics of x (that…

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 exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

We show that a polynomial equation of degree less than 5 and with real parameters can be solved by regarding the variable in which the polynomial depends as a complex variable. For do it so, we only have to separate the real and imaginary…

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…