Related papers: On the Koebe Quarter Theorem for Polynomials
We show that the number of real roots of random trigonometric polynomials with i.i.d. coefficients, which are either bounded or satisfy the logarithmic Sobolev inequality, satisfies an exponential concentration of measure.
Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
We consider the problem of determining the maximum number of common zeros in a projective space over a finite field for a system of linearly independent multivariate homogeneous polynomials defined over that field. There is an elaborate…
We study the Prishchepov groups $P(r,n,k,s,q)$, a unifying family of cyclically presented groups that encompasses many classical cases. For $n$ coprime to $6$, we prove a conjecture essentially characterizing when these groups are perfect:…
In this paper, we obtain new results on the critical points of a polynomial, these results are useful to the Sendov conjecture.
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…
This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…
According to the G\"ottsche conjecture (now a theorem), the degree N^{d, delta} of the Severi variety of plane curves of degree d with delta nodes is given by a polynomial in d, provided d is large enough. These "node polynomials"…
Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…
We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
Special polynomials associated with rational solutions of the second Painlev\'{e} equation and other members of its hierarchy are discussed. New approach, which allows one to construct each polynomial is presented. The structure of the…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
Sendov conjecture tells that if $P$ denotes a complex polynomial having all his zeros in the closed unit disk and $a$ denote a zero of $P$, the closed disk of center $a$ and radius 1 contains a zero of the derivative $P'$. The main result…