نتایج جستجو برای: polynomial inequalities

تعداد نتایج: 141903  

Journal: :Applied Mathematics and Computation 2002
Ravi P. Agarwal Gradimir V. Milovanovic

In this survey paper we give a short account on characterizations for very classical orthogonal polynomials via extremal problems and the corresponding inequalities. Beside the basic properties of the classical orthogonal polynomials we consider polynomial inequalities of Landau and Kolmogoroff type, some weighted polynomial inequalities in L2-norm of Markov-Bernstein type, as well as the corre...

2017
Haewon Joung

Many weighted polynomial inequalities, such as the Bernstein, Marcinkiewicz, Schur, Remez, Nikolskii inequalities, with doubling weights were proved by Mastroianni and Totik for the case [Formula: see text], and by Tamás Erdélyi for [Formula: see text]. In this paper we extend such polynomial inequalities to those for generalized trigonometric polynomials. We also prove the large sieve for gene...

2013
GRADIMIR V. MILOVANOVIĆ THEMISTOCLES M. RASSIAS

This survey paper is devoted to inequalities for zeros of algebraic polynomials. We consider the various bounds for the moduli of the zeros, some related inequalities, as well as the location of the zeros of a polynomial, with a special emphasis on the zeros in a strip in the complex plane.

Journal: :Combinatorica 2004
Christian Bey

For a Sperner family A ⊆ 2 [n] let Ai denote the family of all i-element sets in A. We sharpen the LYM inequality i |Ai|/ n i ≤ 1 by adding to the LHS all possible products of fractions |Ai|/ n i , with suitable coefficients. A corresponding inequality is established also for the linear lattice and the lattice of subsets of a multiset (with all elements having the same multiplicity).

Journal: :Math. Program. 2005
Hartwig Bosse Martin Grötschel Martin Henk

Our main result is that every ro-dimensional polytope can be described by at most (2n — 1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n — 2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities. 1. I N T R O D U C T I O N By a striking result of...

2000
DORU ŞTEFĂNESCU

We give explicit bounds for the absolute values of the coefficients of the divisors of a complex polynomial. They are expressed in function of the coefficients and of upper and lower bounds for the roots. These bounds are compared with other estimates, in particular with the inequality of Beauzamy [B. Beauzamy, Products of polynomials and a priori estimates for coefficients in polynomial decomp...

‎Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$‎, ‎let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$‎. ‎Dewan et al proved‎ ‎that if $p(z)$ has all its zeros in $|z| leq k, (kleq‎ ‎1),$ with $s$-fold zeros at the origin then for every‎ ‎$alphainmathbb{C}$ with $|alpha|geq k$‎, ‎begin{align*}‎ ‎max_{|z|=...

Journal: :Probability Theory and Related Fields 2020

Journal: :Journal of Global Optimization 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید