Related papers: A polynomial approach to the Collatz conjecture
In this note we present a method to bound gaps between primes via the divergence of the series of reciprocals of the prime numbers, a consequence of a version of the Bertrand's test for convergence of series of positive numbers and a…
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 this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
We intend to contribute to the Collatz dynamics problem by seeking to analyze the Collatz conjecture from the tree of numbers sequences. First, we show numerically that the distribution of odd numbers has an initial transient, and proceeds…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…
A key issue in the handling of temporal data is the treatment of persistence; in most approaches it consists in inferring defeasible confusions by extrapolating from the actual knowledge of the history of the world; we propose here a…
We introduce a new method in the attempt to prove the Jacobian conjecture. In the complex dimension 2 case, we apply this method to prove some new results related the Jacobian conjecture.
We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…
The object of the paper is the dependence of Koszul complexes and dependence of dual Koszul complexes of two systems of non-homogeneous polynomials, when one system is a part of other system, in connection with the duality in a Koszul…
The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…
The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
Motivated by the variations of Sarnak's conjecture due to El Abdalaoui, Kulaga-Przymus, Lemanczyk, De La Rue and by the observation that the Mobius function is a good weight (with limit zero) for the polynomial pointwise ergodic theorem in…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…