Related papers: Progress on the unfair 0-1-polynomials conjecture …

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…

The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…

We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial $f$ of degree $d$, there are exactly $2^{d-1}$ distinct degree $d$ polynomials with the same set of cyclic resultants as $f$.…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results.…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

We raise a question on the existence of continuous roots of families of monic polynomials (by the root of a family of polynomials we mean a function of the coefficients of polynomials of a given family that maps each tuple of coefficients…

In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…

We consider the even monic degree-$10$ second cuboid polynomial $Q_{p,q}(t)\in\mathbb{Z}[t]$ depending on coprime integers $p\neq q>0$. We exclude the existence of a splitting of type $5+5$ over $\mathbb{Q}$, i.e., a factorization of…

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…