Related papers: A sharp bound for the Chebyshev functional

In the present paper, a new subclass of analytic and bi-univalent functions by means of Chebyshev polynomials is introduced. Certain coefficient bounds for functions belong to this subclass are obtained. Furthermore, the Fekete-Szego…

Given two nonzero polynomials $f, g \in\mathbb R[x,y]$ and a point $(a, b) \in \mathbb{R}^2,$ we give some necessary and sufficient conditions for the existence of the limit $\displaystyle \lim_{(x, y) \to (a, b)} \frac{f(x, y)}{g(x, y)}.$…

In this paper we establish new optimal bounds for the derivative of some discrete maximal functions, both in the centered and uncentered versions. In particular, we solve a question originally posed by Bober, Carneiro, Hughes and Pierce.

A family of sharp $L^p$ Sobolev inequalities is established by averaging the length of $i$-dimensional projections of the gradient of a function. Moreover, it is shown that each of these new inequalities directly implies the classical $L^p$…

The primary objective of this paper is to derive sharp bounds for the norms of the Schwarzian and pre-Schwarzian derivatives in the Ozaki close-to-convex functions $f$, expressed in terms of their value $f^{\prime\prime}(0)$, in particular,…

We revisit the sharp Sobolev inequalities involving boundary terms on Riemannian manifolds with boundaries proved by \emph{[Y.Y. Li and M. Zhu, Geom. Funct. Anal. \textbf{8} (1998), 59--87.]} and explore the role of the mean curvature.

In this note, we give a new characterisation of Sobolev $W^{1,1}$ functions among $BV$ functions via Hardy-Littlewood maximal function. Exploiting some ideas coming from the proof of this result, we are also able to give a new…

The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.

Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probabilities of sums of Poisson trials, or in regression to…

We establish a novel upper bound for the real solutions of the equation specified in the title, employing a generalized derivation-division algorithm. As a consequence, we also derive a new set of Chebyshev functions adapted specifically…

We prove an analogue of Sadullaev's theorem concerning the size of the set where a maximal totally real manifold can meet a pluripolar set. The manifold has to be of class C-1 only. This readily leads to a version of Shcherbina's theorem…

For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $\phi$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle \phi(\lambda_{1}) \mu(\{x \in \Omega : f(x) \geq…

Let $X$ be a semistable curve and $L$ a line bundle whose multidegree is uniform, i.e., in the range between those of the structure sheaf and the dualizing sheaf of $X$. We establish an upper bound for $h^0(X,L)$, which generalizes the…

We prove density of smooth functions in subspaces of Sobolev- and higher order $BV$-spaces of kind $W^{m,p}(\Omega)\cap L^q(\Omega-D)$ and $BV^m(\Omega)\cap L^q(\Omega-D)$, respectively, where $\Omega\subset\mathbb{R}^n$ ($n\in\mathbb{N}$)…

In this paper a simple proof of the Chebyshev's inequality for random vectors obtained by Chen (arXiv:0707.0805v2, 2011) is obtained. This inequality gives a lower bound for the percentage of the population of an arbitrary random vector X…

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

We prove hybrid subconvexity bounds for a wide class of twisted L-functions $L(s,f\times \chi)$ at the central point, including a new instance of the Weyl subconvexity bound.

Sharp affine fractional $L^p$ Sobolev inequalities for functions on $\mathbb R^n$ are established. The new inequalities are stronger than (and directly imply) the sharp fractional $L^p$ Sobolev inequalities. They are fractional versions of…

In applied mathematics, especially in optimization, functions are often only provided as so called "Black-Boxes" provided by software packages, or very complex algorithms, which make automatic differentation very complicated or even…

We prove that if $u:\mathbb{R}^n\to\mathbb{R}$ is strongly convex, then for every $\varepsilon>0$ there is a strongly convex function $v\in C^2(\mathbb{R}^n)$ such that $|\{u\neq v\}|<\varepsilon$ and $\Vert u-v\Vert_\infty<\varepsilon$.