Related papers: Factors of Sparse Polynomials are Sparse

We prove an irreducibility criterion for polynomials of the form $h(x)=x^{2m} + bx^m + c_1 \in F[x]$ relating to the Dickson polynomials of the first kind $D_p$. In the case when $F = \mathbb{Q}$, $m$ is a prime $p>3$, and $c_1=c^p$, for…

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

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 formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

In 2002, M.Ram Murty showed that if p is a prime with k-adic expansion :$p = \sum_{i = 0}^n a_i k^i$ , then the polynomial $f(x) = \sum_{i = 0}^n a_ix^i$ is irreducible in $\mathbb{Z}[x]$.When $k = 10$ , it's a result of A.Cohn. I think…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Let P be the set of all primes and P_2=P\cup{p_1p_2: p_1,p_2\in P}$. We prove that the sumset 2^P+P_2={2^p+q: p\in P, q\in P_2} has a positive lower density.

Extending earlier results of the authors on minimal polynomials of $p$-elements of finite groups of Lie type in cross-characteristic representations, this paper focuses on the case where Sylow $p$-subgroups are cyclic and $p$ is distinct…

We present an algorithm which computes the multilinear factors of bivariate lacunary polynomials. It is based on a new Gap Theorem which allows to test whether a polynomial of the form P(X,X+1) is identically zero in time polynomial in the…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

For several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or modulo a polynomial ideal. We describe new strategies…

Motivated by $\ell_p$-optimization arising from sparse optimization, high dimensional data analytics and statistics, this paper studies sparse properties of a wide range of $p$-norm based optimization problems with $p > 1$, including…

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…

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…

For a polynomial $P$ of degree greater than one, we show the existence of patterns of the form $(x,x+t,x+P(t))$ with a gap estimate on $t$ in positive density subsets of the reals. This is an extension of an earlier result of Bourgain. Our…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that…

We prove expressions for the inequalities in Hermite's theorem which are conditions for a real polynomial to have real zeros. These expressions generalize the discriminant of a quadratic polynomial and the expression of J. Mar\'ik for a…

Let T^{N,chi}_{p,k}(x) be the characteristic polynomial of the Hecke operator T_p acting on the space of cusp forms S_k(N,chi). We describe the factorization of T^{N,chi}_{p,k}(x) mod l as k varies, and we explicitly calculate those…