Related papers: On zeros of self-reciprocal polynomials

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

We consider polynomials on the unit circle defined by the recurrence relation \Phi_{k+1}(z) = z \Phi_{k} (z) - \bar{\alpha}_{k} \Phi_k^{*}(z) for k \geq 0 and \Phi_0=1. For each n we take \alpha_0, \alpha_1, ...,\alpha_{n-2} i.i.d. random…

The Sendov conjecture asserts that if all the zeros of a polynomial p lie in the closed unit disk then there must be a zero of p ' within unit distance of each zero. In this paper we give a partial result when p has simple zeros.

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

We consider Apollonian circle packings of a half Euclidean plane. We give necessary and sufficient conditions for two such packings to be related by a Euclidean similarity (that is, by translations, reflections, rotations and dilations) and…

We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…

In this paper, we introduce polynomials (in $t$) of signed relative derangements that track the number of signed elements. The polynomials are clearly seen to be in a sense symmetric. Note that relative derangements are those without any…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

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…

In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…

Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…

Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

Let ${z_n}$ be a sequence in the unit disk ${z\in\mathbb{C}:|z|<1}$. It is known that there exists a unique positive Borel measure in the unit circle ${z\in\mathbb{C}:|z|=1}$ such that the orthogonal polynomials ${\Phi_n}$ satisfy…

We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.

We investigate two distinct formulations of Laurent multiple orthogonal polynomials on the unit circle, introduced in arXiv:2410.12094 and arXiv:2601.04783 respectively. For the first formulation, we prove that all zeros lie strictly within…

We extend a theorem of Herman from the case of unicritical polynomials to the case of polynomials with two finite critical values. This theorem states that Siegel disks of such polynomials, under a diophantine condition (called Herman's…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…