Related papers: Polynomials with prescribed bad primes

Given $f\in \mathbb{Z}[t]$ of positive degree, we investigate the existence of auxiliary polynomials $g\in \mathbb{Z}[t]$ for which $f(g(t))$ factors as a product of polynomials of small relative degree. One consequence of this work shows…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

We introduce the notion of Bernstein-Sato polynomial of an arbitrary variety (which is not necessarily reduced nor irreducible), using the theory of V-filtrations of M. Kashiwara and B. Malgrange. We prove that the decreasing filtration by…

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

We give results on zeros of a polynomial of $\zeta(s),\zeta'(s),\ldots,\zeta^{(k)}(s)$. First, we give a zero free region and prove that there exist zeros corresponding to the trivial zeros of the Riemann zeta function. Next, we estimate…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose…

Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the…

We prove that, over a field of characteristic $0$, the degrees of factors of a binomial $t^n-\alpha$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the…

In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed…

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

Given an ordered set partition, when one insert a number of bars in-between the blocks of the ordered set partition the result is a barred preferential arrangement. In this study, using the notion of barred preferential arrangements we…

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…