Related papers: On Suffridge polynomials

In 1976 Suffridge proved an intruiging theorem regarding the convolution of polynomials with zeros only on the unit circle. His result generalizes a special case of the fundamental Grace-Szeg\"o convolution theorem, but so far it is an open…

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3,…

The famous T. Suffridge polynomials have many extremal properties: the maximality of coefficients when the leading coefficient is maximal; the zeros of the derivative are located on the unit circle; the maximum radius of stretching the unit…

We show the univalence of $T$-symmetric Suffridge type polynomials $S_4^{(T)}$ in the unit disk, confirming thereby the conjecture proposed by Dmitrishin, Gray, and Stokolos in their recent paper. The result also implies the…

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

We extend a technique, originally due to the first author and Poonen, for proving cases of the Strong Uniform Boundedness Principle (SUBP) in algebraic dynamics over function fields of positive characteristic. The original method applied to…

This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

We introduce a subfamily of additive enlargements of a maximally monotone operator. Our definition is inspired by the early work of Simon Fitzpatrick. These enlargements constitute a subfamily of the family of enlargements introduced by…

Subresultants of two univariate polynomials are one of the most classic and ubiquitous objects in computational algebra and algebraic geometry. In 1948, Habicht discovered and proved interesting relationships among subresultants. Those…

We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all…

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…

In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal ones. We disproved Dimitrov's conjecture…

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 introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters $(q,t)$ and polynomial in a further two parameters $(u,v)$. We evaluate these polynomials explicitly as a matrix…