Related papers: Iteration of Quadratic Polynomials Over Finite Fie…

For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…

Let $q$ be a quadratic form over a field $F$ and let $L$ be a field extension of $F$ of odd degree. It is a classical result that if $q_L$ is isotropic (resp. hyperbolic) then $q$ is isotropic (resp. hyperbolic). In turn, given two…

We introduce a finite difference and $q$-difference analogues of the Asymptotic Iteration Method of Ciftci, Hall, and Saad. We give necessary, and sufficient condition for the existence of a polynomial solution to a general linear…

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

We call a polynomial monogenic if a root $\theta$ has the property that $\mathbb{Z}[\theta]$ is the full ring of integers in $\mathbb{Q}(\theta)$. Consider the two families of trinomials $x^n + ax + b$ and $x^n + cx^{n-1} + d$. For any…

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

We consider QCD_3 with an odd number of flavors in the mesoscopic scaling region where the field theory finite-volume partition function is equivalent to a random matrix theory partition function. We argue that the theory is parity…

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

Fix a prime number $d$. The post-critically finite polynomials of the form $f_{d,c} = x^d+c\in \mathbb{C}[x]$ play a fundamental role in polynomial dynamics. While many results are known in the complex dynamical setting, much less is…

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

The properties of continued fractions whose partial quotients belong to a quadratic number field K are distinct from those of classical continued fractions. Unlike classical continued fractions, it is currently impossible to identify…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

Given a sequence of complex numbers {\rho}_n, we study the asymptotic distribution of the sets of parameters c {\epsilon} C such that the quadratic maps z^2 +c has a cycle of period n and multiplier {\rho}_n. Assume 1/n.log|{\rho}_n| tends…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…