English
Related papers

Related papers: On Bernstein's inequality for polynomials

200 papers

The Markov-Bernstein type inequalities between the norms of functions and of their derivatives are analysed for complex exponential polynomials. We establish a relation between the sharp constants in those inequalities and the stability…

Functional Analysis · Mathematics 2022-09-27 Vladimir Yu. Protasov

We introduce a canonical notion of entropy for polynomials analogue to that of random variables in probability. We prove that entropy increases smoothly with respect to finite free addition. In particular we get the new inequality : $…

Classical Analysis and ODEs · Mathematics 2023-11-07 Aurelien Gribinski

In this work, Bernstein's concentration inequalities for squared integrable matrix-valued discrete-time martingales are obtained. Based on Lieb's theory and Bernstein's condition, a suitable supermartingale can be constructed. Our proof is…

Probability · Mathematics 2021-03-26 Zijie Tian

Starting out from a question posed by T. Erd\'elyi and J. Szabados, we consider Schur-type inequalities for the classes of complex algebraic polynomials having no zeroes within the unit disk D. The class of polynomials with no zeroes in D -…

Classical Analysis and ODEs · Mathematics 2007-05-23 Szilárd Gy. Révész

We prove `polynomial in $k$' bounds on the size of the Bergman kernel for the space of holomorphic Siegel cusp forms of degree $n$ and weight $k$. When $n=1,2$ our bounds agree with the conjectural bounds on the aforementioned size, while…

Number Theory · Mathematics 2022-06-07 Soumya Das , Hariram Krishna

The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…

History and Overview · Mathematics 2018-01-24 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

Classical Analysis and ODEs · Mathematics 2018-09-21 Tamás Erdélyi

In this review paper, we explore operator aspects in extremal properties of Bernstein-type polynomial inequalities. We shall also see that a linear operator which send polynomials to polynomials and have zero-preserving property naturally…

Functional Analysis · Mathematics 2024-12-02 S. Gulzar , Ravinder Kumar , Mudassir A Bhat

Recently, Nagy-To\'okos and Totik-Varga proved an asymptotically sharp $L^{p}$ Bernstein type inequality on union of finitely many intervals. We extend this inequality to the case when the power $p$ is between $0$ and $1$; such sharp…

Classical Analysis and ODEs · Mathematics 2014-09-01 Béla Nagy , Tamás Varga

Given a $d$-tuple $T$ of commuting contractions on Hilbert space and a polynomial $p$ in $d$-variables, we seek upper bounds for the norm of the operator $p(T)$. Results of von Neumann and And\^o show that if $d=1$ or $d=2$, the upper bound…

Functional Analysis · Mathematics 2024-11-08 Michael Hartz

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

In this note we characterize when non-classical polynomials are necessary in the inverse theorem for the Gowers $U^k$-norm. We give a brief deduction of the fact that a bounded function on $\mathbb F_p^n$ with large $U^k$-norm must…

Combinatorics · Mathematics 2022-10-28 Aaron Berger , Ashwin Sah , Mehtaab Sawhney , Jonathan Tidor

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

History and Overview · Mathematics 2007-05-23 Ferdinand Minding

In this paper we obtain a Bernstein type inequality for a class of weakly dependent and bounded random variables. The proofs lead to a moderate deviations principle for sums of bounded random variables with exponential decay of the strong…

Probability · Mathematics 2012-02-23 Florence Merlevède , Magda Peligrad , Emmanuel Rio

We consider the classical problem of estimating norm of the derivative of algebraic polynomial via the norm of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by V. Markov. In this…

Classical Analysis and ODEs · Mathematics 2012-05-07 Oleksiy Klurman

We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…

Commutative Algebra · Mathematics 2024-07-29 Grigory Chelnokov , Maxim Turevskii

In this note, we give a criteria whether given two Eisenstein polynomials over a padic field define the same extension (Proposition 1.6). In particular, we completely identify Eisenstein polynomials of degree p (Theorem 1.16). This note is…

Number Theory · Mathematics 2013-02-06 Shun'ichi Yokoyama , Manabu Yoshida

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

Number Theory · Mathematics 2020-01-01 Vesselin Dimitrov
‹ Prev 1 3 4 5 6 7 10 Next ›