We analyse the behaviour of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field $\mathbb{F}_{q}$ of q elements when the highest degree polynomial g is fixed. Considering all the elements f of fixed degree, we establish asymptotically optimal bounds in terms of q for the number of elements f that are relatively prime with g and for the average degree of $\gcd(g,f)$ . We also exhibit asymptotically optimal bounds for the average-case complexity of the Euclidean algorithm applied to pairs (g,f) as above.

In [5], Chen and Yui conjectured that Gross–Zagier type formulas may also exist for Thompson series. In this work, we verify Chen and Yui’s conjecture for the cases for Thompson series $j_{p}(\tau )$ for $\Gamma _{0}(p)$ for p prime, and equivalently establish formulas for the prime decomposition of the resultants of two ring class polynomials associated to $j_{p}(\tau )$ and imaginary quadratic fields and the prime decomposition of the discriminant of a ring class polynomial associated to $j_{p}(\tau )$ and an imaginary quadratic field. Our method for tackling Chen and Yui’s conjecture on resultants can be used to give a different proof to a recent result of Yang and Yin. In addition, as an implication, we verify a conjecture recently raised by Yang, Yin, and Yu.

Let $P\in \mathbb{F}_{2}[z]$ be such that $P(0)=1$ and degree $(P)\geq 1$. Nicolas et al. [‘On the parity of additive representation functions’, J. Number Theory73 (1998), 292–317] proved that there exists a unique subset ${\mathcal{A}}={\mathcal{A}}(P)$ of $\mathbb{N}$ such that $\sum _{n\geq 0}p({\mathcal{A}},n)z^{n}\equiv P(z)~\text{mod}\,2$, where $p({\mathcal{A}},n)$ is the number of partitions of $n$ with parts in ${\mathcal{A}}$. Let $m$ be an odd positive integer and let ${\it\chi}({\mathcal{A}},.)$ be the characteristic function of the set ${\mathcal{A}}$. Finding the elements of the set ${\mathcal{A}}$ of the form $2^{k}m$, $k\geq 0$, is closely related to the $2$-adic integer $S({\mathcal{A}},m)={\it\chi}({\mathcal{A}},m)+2{\it\chi}({\mathcal{A}},2m)+4{\it\chi}({\mathcal{A}},4m)+\cdots =\sum _{k=0}^{\infty }2^{k}{\it\chi}({\mathcal{A}},2^{k}m)$, which has been shown to be an algebraic number. Let $G_{m}$ be the minimal polynomial of $S({\mathcal{A}},m)$. In precedent works there were treated the case $P$ irreducible of odd prime order $p$. In this setting, taking $p=1+ef$, where $f$ is the order of $2$ modulo $p$, explicit determinations of the coefficients of $G_{m}$ have been made for $e=2$ and 3. In this paper, we treat the case $e=4$ and use the cyclotomic numbers to make explicit $G_{m}$.

We obtain an upper bound for the number of solutions to the system of $m$ congruences of the type

$$\begin{eqnarray}\displaystyle \mathop{\prod }_{i=1}^{{\it\nu}}(x_{i}+s_{i})\equiv {\it\lambda}_{j}~(\text{mod }p)\quad j=1,\ldots ,m, & & \displaystyle \nonumber\end{eqnarray}$$

$p$

$1\leq x_{i}\leq h$

$i=1,\ldots ,{\it\nu}$

$s_{j},{\it\lambda}_{j}$

$j=1,\ldots ,m$

$h$

$p$

We give an explicit formula for the resultant of Chebyshev polynomials of the first, second, third, and fourth kinds. We also compute the resultant of modified cyclotomic polynomials.

We give a simple proof of the value of the resultant of two Chebyshev polynomials (of the first or the second kind), values lately obtained by D. P. Jacobs, M. O. Rayes, and V. Trevisan.

Let ${{T}_{n}}$ denote the $n$-th Chebyshev polynomial of the first kind, and let ${{U}_{n}}$ denote the $n$-th Chebyshev polynomial of the second kind. We give an explicit formula for the resultant res$({{T}_{m}},\,{{T}_{n}})$. Similarly, we give a formula for res$({{U}_{m}},\,{{U}_{n}})$.

We show that the multiplicity of a prime p as a factor of the resultant of two polynomials with integer coefficients is at least the degree of their greatest common divisor modulo p. This answers an open question by Konyagin and Shparlinski.