English
Related papers

Related papers: Reverse Bernstein Inequality on the Circle

200 papers

The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…

Mathematical Physics · Physics 2016-08-16 Yves Grandati , Alain Bérard , Ferhat Menas

Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…

Logic · Mathematics 2016-03-30 Ludovic Patey

In this paper we prove exponential inequalities (also called Bernstein's inequality) for fractional martingales. As an immediate corollary, we will discuss weak law of large numbers for fractional martingales under divergence assumption on…

Probability · Mathematics 2012-04-20 Bruno Saussereau

Some elementary inequalities providing upper bounds for the difference of the norm and the numerical radius of a bounded linear operator on Hilbert spaces under appropriate conditions are given.

Functional Analysis · Mathematics 2007-05-23 Sever Silvestru Dragomir

We give a new lower bound for the discrete norm of a polynomial on the circle

Complex Variables · Mathematics 2012-03-13 V. N. Dubinin

The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the…

Probability · Mathematics 2015-10-06 J. Michael Steele

The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…

Combinatorics · Mathematics 2022-05-09 Chai Wah Wu

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

Spectral Theory · Mathematics 2022-03-31 Tanay Wakhare , Charles R. Johnson

Let $k$ be a field of characteristic zero, let $R$ be the ring of formal power series in $n$ variables over $k$ and let $D(R,k)$ be the ring of $k-$linear differential operators in $R$. If $M$ is a finitely generated $D(R,k)-$module then…

Commutative Algebra · Mathematics 2017-08-31 Peyman Ghahremani

We present an elementary proof of a conjecture by I. Ra\c{s}a which is an inequality involving Bernstein basis polynomials and convex functions. It was affirmed in positive very recently by the use of stochastic convex orderings. Moreover,…

Classical Analysis and ODEs · Mathematics 2016-09-02 Ulrich Abel

Reverse differentiation is an essential operation for automatic differentiation. Cartesian reverse differential categories axiomatize reverse differentiation in a categorical framework, where one of the primary axioms is the reverse chain…

Logic in Computer Science · Computer Science 2025-09-26 Aaron Biggin , Jean-Simon Pacaud Lemay

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

Classical Analysis and ODEs · Mathematics 2014-06-17 D. Babusci , G. Dattoli , K. Górska , K. A. Penson

Let $\mathscr{C}_\mathbb{Z}([0,1])$ be the metric space of real-valued continuous functions on $[0,1]$ with integer values at $0$ and $1$, equipped with the uniform (supremum) metric $d_\infty$. It is a classical theorem in approximation…

Number Theory · Mathematics 2023-11-21 C. Sinan Güntürk , Weilin Li

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Computational Complexity · Computer Science 2014-12-16 Abhishek Bhowmick , Shachar Lovett

We extend the classical Bernstein inequality to a general setting including Schr{\"o}dinger operators and divergence form elliptic operators on Riemannian manifolds or domains. Moreover , we prove a new reverse inequality that can be seen…

Analysis of PDEs · Mathematics 2021-06-11 Rafik Imekraz , El Maati Ouhabaz

The supremum of reduction numbers of ideals having principal reductions is expressed in terms of the integral degree, a new invariant of the ring, which is finite provided the ring has finite integral closure. As a consequence, one obtains…

Commutative Algebra · Mathematics 2007-06-25 José M. Giral , Francesc Planas-Vilanova

A simple method is shown to provide optimal variational bounds on $f$-divergences with possible constraints on relative information extremums. Known results are refined or proved to be optimal as particular cases.

Information Theory · Computer Science 2019-02-05 Olivier Binette

We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.

Optimization and Control · Mathematics 2012-11-07 Vincenzo Ferone , Carlo Nitsch , Cristina Trombetti

We show that the Bernstein-Hoeffding method can be employed to a larger class of generalized moments. This class includes the exponential moments whose properties play a key role in the proof of a well-known inequality of Wassily Hoeffding,…

Probability · Mathematics 2015-09-02 Christos Pelekis , Jan Ramon , Yuyi Wang
‹ Prev 1 4 5 6 7 8 10 Next ›