Perturbation bounds for polynomials

Using two different elementary approaches we derive a global and a local perturbation theorem on polynomial zeros that significantly improve the results of Ostrowski (Acta Math 72:99–257, 1940), Elsner et al. (Linear Algebra Appl 142:195–209, 1990). A comparison of different perturbation bounds shows that our results are better in many cases than the similar local result of Beauzamy (Can Math Bull 42(1):3–12, 1999). Using the matrix theoretical approach we also improve the backward stability result of Edelman and Murakami (Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, SIAM, Philapdelphia, 1994; Math Comput 64:210–763, 1995).     

Lower bounds and upper bounds for chromatic polynomials

In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m edges and girth exceeding g © 1993 John Wiley & Sons, Inc.     

Error bounds for least squares approximation by polynomials

Let f ε Cⁿ⁺¹[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial approximation to f with respect to the orthonormal polynomials q_k associated with a distribution dα on [−1, 1]. It is shown that if q_n+1/q_n max(q_n+1(1)/q_n(1), −q_n+1(−1)/q_n(−1)), then f − H[f] f^{n + 1} · q_n+1/q_{n + 1}^{(n + 1)}, where · denotes the supremum norm. Furthermore, it is shown that in the case of Jacobi polynomials with distribution (1 − t)^α (1 + t)^β dt, α, β > −1, the condition on q_n+1/q_n is satisfied when either max(α,β) −1/2 or −1 < α = β < −1/2.     

A projection algorithm on the set of polynomials with two bounds

Numerical Algorithms - The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the...     

Lower bounds for polynomials of many variables

A polynomial P(ξ) = P(ξ₁,..., ξ _n ) is said to be almost hypoelliptic if all its derivatives D ^ν P(ξ) can be estimated from above by P(ξ) (see [16]). By a theorem of Seidenberg-Tarski it follows that for each polynomial P(ξ) satisfying the condition P(ξ) > 0 for all ξ ∈ R ⁿ , there exist numbers σ > 0 and T ∈ R¹ such that P(ξ) ≥ σ(1 + |ξ|) ^T for all ξ ∈ R ⁿ . The greatest of numbers T satisfying this condition, denoted by ST(P), is called Seidenberg-Tarski number of polynomial P. It is known that if, in addition, P ∈ I _n , that is, |P(ξ)| → ∞ as |ξ| → ∞, then T = T(P) > 0. In this paper, for a class of almost hypoelliptic polynomials of n (≥ 2) variables we find a sufficient condition for ST(P) ≥ 1. Moreover, in the case n = 2, we prove that ST(P) ≥ 1 for any almost hypoelliptic polynomial P ∈ I₂.     

Sharp bounds for the valence of certain harmonic polynomials

In Khavinson and Swiatek (2002) it was proved that harmonic polynomials , where is a holomorphic polynomial of degree , have at most complex zeros. We show that this bound is sharp for all by proving a conjecture of Sarason and Crofoot about the existence of certain extremal polynomials . We also count the number of equivalence classes of these polynomials.

     

Global error bounds for piecewise convex polynomials

In this paper, by examining the recession properties of convex polynomials, we provide a necessary and sufficient condition for a piecewise convex polynomial to have a Hölder-type global error bound with an explicit Hölder exponent. Our result extends the corresponding results of Li (SIAM J Control Optim 33(5):1510–1529, 1995) from piecewise convex quadratic functions to piecewise convex polynomials.     

Lower bounds for Kazhdan-Lusztig polynomials from patterns

Kazhdan-Lusztig polynomials P_x,w(q) play an important role in the study of Schubert varieties as well as the representation theory of semisimple Lie algebras. We give a lower bound for the values P_x,w(1) in terms of "patterns". A pattern for an element of a Weyl group is its image under a combinatorially defined map to a subgroup generated by reflections. This generalizes the classical definition of patterns in symmetric groups. This map corresponds geometrically to restriction to the fixed point set of an action of a one-dimensional torus on the flag variety of a semisimple group G. Our lower bound comes from applying a decomposition theorem for "hyperbolic localization" [Br] to this torus action. This gives a geometric explanation for the appearance of pattern avoidance in the study of singularities of Schubert varieties.     

Upper bounds of Schubert polynomials

Science China Mathematics - Let w be a permutation of {1, 2, …, n}, and let D(w) be the Rothe diagram of w. The Schubert polynomial ${\mathfrak{S}_w}\left(x \right)$ can be realized as the...     

Upper bounds for the autocorrelation coefficients of the Rudin-Shapiro polynomials

Givena _m to be them ^th correlation coefficient of the Rudin-Shapiro polynomials of degrees 2 ⁿ ? 1, ¦a _m¦ ≤ C(2 ⁿ )^3/4 and there existsk ≠ 0 such that ¦a _k¦ >D(2 ⁿ )^0.73 (C andD are universal constants). Here we show that the 0.73 is optimal in the upper bound case.     

On lower bounds for polynomials in the values of E-functions

The paper considers polynomials in ,f₁(),...,f_s(), where is an algebraic number satisfying certain conditions and f₁(z),...,f_s(z) are some E-functions, algebraically independent over the field of rational functions. Explicit lower bounds in terms of the heights of and the polynomial are obtained for the absolute values of these polynomials. The result is proved by using the method of Siegel and idlovskii.This work was carried out while the author was a research fellow of the Alexander von Humboldt Foundation.     

Sharp bounds for the extreme zeros of classical orthogonal polynomials

Bounds for the extreme zeros of the classical orthogonal polynomials are obtained by a surprisingly simple method. Nevertheless, it turns out that, in most cases, the estimates obtained in this note are better than the best limits known in the literature.     

Optimal graphs for chromatic polynomials

Let F(n,e) be the collection of all simple graphs with n vertices and e edges, and for G∈F(n,e) let P(G;λ) be the chromatic polynomial of G. A graph G∈F(n,e) is said to be optimal if another graph H∈F(n,e) does not exist with P(H;λ)?P(G;λ) for all λ, with strict inequality holding for some λ. In this paper we derive necessary conditions for bipartite graphs to be optimal, and show that, contrarily to the case of lower bounds, one can find values of n and e for which optimal graphs are not unique. We also derive necessary conditions for bipartite graphs to have the greatest number of cycles of length 4.     

Interpolation by Lagrange polynomials,B-splines and bounds of errors

m N k=m–2,m–1

Bounds for the variance of functions of random variables by orthogonal polynomials and Bhattacharya bounds

Upper and lower bounds for the variance of a function g of a random variable X are obtained by expanding g in a series of orthogonal polynomials associated with the distribution of X or by using the convergence of Bhattacharya bounds for exponential families of distribution.     

Exact upper bounds for the number of the polynomials with given discriminants

We generalize the result of Davenport on the sum of absolute values of discriminants of integer polynomials of degree three. For the first time, we find the exact upper bound for the number of polynomials with given discriminant in the class of cubic polynomials of bounded height for the whole interval of values of discriminants.