Related papers: Iterates of Quadratics and Monogenicity

We study a map that sends a monic degree n complex polynomial f(x) without multiple roots to the collection of n values of its derivative at the roots of f(x). We give an answer to a question posed by Ju.S. Ilyashenko.

The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of $\mathbb{F}_{q^n}$-linear MRD codes. The first infinite family in the first…

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…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…

For any $n\geq 1$, let $T_n$ be the complete binary rooted tree of height $n$, and $f(x)=(x+a)^2-a-1$ such that $a\neq \pm b^2$ for any $b\in \mathbb{Z}$. In \cite{Settled}, Jones and Boston empirically observed that iteratively applying a…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

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 consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

The aim of this article is to obtain a formula giving, for a positive integer $n$, the number of roots of the $n^{th}$ continuant polynomial over a finite local ring. In particular, we will give counting formulae for the roots of the…

Let $K=\mathbb{Q}(\alpha)$ be a number field generated by a complex root $\alpha$ of a monic irreducible polynomial $f(x)=x^{12}-m$, with $m\neq 1$ is a square free rational integer. In this paper, we prove that if $m \equiv 2$ or $3$ (mod…

It is a classical problem in algebraic number theory to decide if a number field is monogeneous, that is if it admits power integral bases. It is especially interesting to consider this question in an infinite parametric familiy of number…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

The two subjects in the title are related via the specialization of symmetric polynomials at roots of unity. Let $f(z_1,\ldots,z_n)\in\mathbb{Z}[z_1,\ldots,z_n]$ be a symmetric polynomial with integer coefficients and let $\omega$ be a…

We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…

A class of scattered linearized polynomials covering infinitely many field extensions is exhibited. More precisely, the $q$-polynomial over $\mathbb F_{q^6}$, $q \equiv 1\pmod 4$ described in arXiv:1906.05611, arXiv:1910.02278 is…