Related papers: On Suffridge polynomials
Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We establish the strong asymptotics for Bergman orthogonal polynomials defined over Jordan domains with corners. This complements an investigation started in 1923 by T. Carleman, who derived the strong asymptotics for domains bounded by…
In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
In 1853 J. Sylvester introduced a family of double sum expressions for two finite sets of indeterminates and showed that some members of the family are essentially the polynomial subresultants of the monic polynomials associated with these…
We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…
We investigate the (ambient) bi-Lipschitz V-equivalence of two-variable mixed polynomials satisfying the Newton inner non-degeneracy condition. Concerning triviality, we show that ambient bi-Lipschitz V-triviality for families $\{f +…
In this paper, we consider the Atkin-like polynomials that appeared in the study of normalized extremal quasimodular forms of depth 1 on $SL_{2}(\mathbb{Z})$ by Kaneko and Koike as orthogonal polynomials and clarify their properties. By…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…
We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…
A new family of skew-symmetric solutions of the Jacobi partial differential equations for finite-dimensional Poisson systems is characterized and analyzed. Such family has some remarkable properties. In first place, it is defined for…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
About twenty years ago the measure of smoothness $\omega ^r_\phi (f,t)$ was introduced and related to the rate of polynomial approximation. In this article we survey developments about this and related concepts since that time.