Related papers: Some remarks on rotation theorems for complex poly…

The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dickson algebras and their manifolds of zeros. The problems about expressibility of zeros with the help of roots and decomposibility of…

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

We study the polynomial entropy of the wandering part of any invertible dynamical system on a compact metric space. As an application we compute the polynomial entropy of Brouwer homeomorphisms (fixed point free orientation preserving…

Let $n_1 < n_2 < \cdots < n_N$ be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(\theta) = \sum_{j=1}^N {\cos (n_j\theta)}$ tends to $\infty$ as a…

The derivative of a polynomial with all zeros on the unit circle has the zeros of its derivative on or inside the unit circle. It has been observed that in many cases the zeros of the derivative have a bimodal distribution: there are two…

Using PET and quantitative concatenation techniques, we establish box-norm control with the "expected" directions for counting operators for general multidimensional polynomial progressions, with at most polynomial losses in the parameters.…

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…

Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…

We study permutation polynomials through the device of the \emph{polypermutation group} of an associative ring $R$, denoted by ${\rm Pgr}(R)$. We derive some basic properties and compute the cardinality of ${\rm Pgr}(\mathbb{Z}/p^k)$ when…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…

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…

We consider the problem of characterizing the extreme points of the set of analytic functions f on the bidisk with positive real part and f(0)=1. If one restricts to those f whose Cayley transform is a rational inner function, one gets a…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

We determine the maximal angular perturbation of the (n+1)th roots of unity permissible in the Marcinkiewicz-Zygmund theorem on L^p means of polynomials of degree at most n. For p=2, the result is an analogue of the Kadets 1/4 theorem on…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

We introduce a canonical notion of entropy for polynomials analogue to that of random variables in probability. We prove that entropy increases smoothly with respect to finite free addition. In particular we get the new inequality : $…

Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…

Let D be the open unit disc in C. The paper deals with the following conjecture: If f is a continuous function on bD such that the change of argument of Pf+1 around bD is nonnegative for every polynomial P such that Pf+1 has no zero on bD…

Let $D$ be a domain obtained by removing, out of the unit disk $\{z:|z|<1\}$, finitely many mutually disjoint closed disks, and for each integer $n\geq 0$, let $P_n(z)=z^n+\cdots$ be the monic $n$th-degree polynomial satisfying the planar…