Related papers: Polynomials with palindromic and unimodal coeffici…

Let $f$ bea noncommutativepolynomial of degree $m\ge 1$ over an algebraically closed field $F$ of characteristic $0$. If $n\ge m-1$ and $\alpha_1,\alpha_2,\alpha_3$ are nonzero elements from $F$ such that $\alpha_1+\alpha_2+\alpha_3=0$,…

Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7…

We investigate the coefficients of the polynomial \[ S_{m,r}^n(\ell)=r^n+(m+r)^n+(2m+r)^n+\cdots+((\ell-1)m+r)^n. \] We prove that these can be given in terms of Stirling numbers of the first kind and $r$-Whitney numbers of the second kind.…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

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…

An abelian monogenic polynomial $f(x)\in {\mathbb Z}[x]$ is a monic polynomial of degree $N$ that is irreducible over ${\mathbb Q}$, such that the Galois group of $f(x)$ over ${\mathbb Q}$ is abelian, and…

Let $q$ be a prime power, $2\le r\le q$, and $f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}]$, where $a\ne 0$. The conditions on $r,q,a$ that are necessary and sufficient for $f$ to be a permutation polynomial (PP) of ${\Bbb…

Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…

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…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…

In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We explore families of pairs of quadratic polynomials $f(x)=x^2+c\in \mathbb{Q}$ and $a\in \mathbb{Q}$ with $a$ being a strictly preperiodic point of $f$ to provide infinitely many new examples for which the associated arboreal Galois…

The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…

The big $-1$ Jacobi polynomials $(Q_n^{(0)}(x;\alpha,\beta,c))_n$ have been classically defined for $\alpha,\beta\in(-1,\infty)$, $c\in(-1,1)$. We extend this family so that wider sets of parameters are allowed, i.e., they are non-standard.…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

It is well known that a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2 \pi) $, with the coefficients being independent and identically distributed (i.i.d.) real-valued standard Gaussian random variables…

We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…