English
Related papers

Related papers: Sharp mutliplicative inequalities with $\mathrm{BM…

200 papers

We propose a novel mixed-integer programming (MIP) formulation for generating precise sparse correspondences for highly non-rigid shapes. To this end, we introduce a projected Laplace-Beltrami operator (PLBO) which combines intrinsic and…

Computer Vision and Pattern Recognition · Computer Science 2024-04-04 Maolin Gao , Paul Roetzer , Marvin Eisenberger , Zorah Lähner , Michael Moeller , Daniel Cremers , Florian Bernard

In 1989 Almgren and Lieb proved a rearrangement inequality for the Sobolev spaces of fractional order $W^{s,p}$. The case $p = 2$ of their result implies the nonlocal isoperimetric inequality \[ \frac{P_s(E)}{|E|^{\frac{N-2s}N}} \ge…

Analysis of PDEs · Mathematics 2020-01-03 Nicola Garofalo

We consider least squares approximation of a function of one variable by a continuous, piecewise-linear approximand that has a small number of breakpoints. This problem was notably considered by Bellman who proposed an approximate algorithm…

Optimization and Control · Mathematics 2018-06-29 Olof Troeng , Mattias Fält

Given an integer $m\geq2$, the Hardy--Littlewood inequality (for real scalars) says that for all $2m\leq p\leq\infty$, there exists a constant $C_{m,p}% ^{\mathbb{R}}\geq1$ such that, for all continuous $m$--linear forms…

Functional Analysis · Mathematics 2015-10-06 Gustavo Araujo , Daniel Pellegrino

Let $(\lambda_n)_{n \geq 1}$ be a non-negative sequence with $\lambda_1>0$ and let $\Lambda_n=\sum^n_{i=1}\lambda_i$. We study the following Copson inequality for $0<p<1$, $L>p$, \begin{align*} \sum^{\infty}_{n=1}\left (\frac 1{\Lambda_n}…

Classical Analysis and ODEs · Mathematics 2018-06-21 Peng Gao , Huayu Zhao

In this paper, the author establishes some interpolation results between Lorentz, Morrey and BMO spaces. Let $1<p<\infty$ and $p\leq r\leq\infty$. It is proved that the space $L^{p,r}(\mathbb R^n)\cap\mathrm{BMO}(\mathbb R^n)$ is…

Classical Analysis and ODEs · Mathematics 2025-11-11 Hua Wang

An improvement of a {\em Global (strong) Gagliardo-Nienberg inequality with a BMO term} is established by replacing local derivatives by {\em and fractional Laplacians.} Local versions are also given.

Analysis of PDEs · Mathematics 2026-05-04 Dung Le

This article investigates discrete-time approximations of stochastic integrals driven by semimartingales with jumps via weighted bounded mean oscillation (BMO) approach. This approach enables $L_p$-estimates, $p \in (2, \infty)$, for the…

Probability · Mathematics 2021-12-14 Nguyen Tran Thuan

We prove explicit error bounds for Markov chain Monte Carlo (MCMC) methods to compute expectations of functions with unbounded stationary variance. We assume that there is a $p\in(1,2)$ so that the functions have finite $L_p$-norm. For…

Statistics Theory · Mathematics 2015-01-27 Daniel Rudolf , Nikolaus Schweizer

The paper is devoted to two-weight estimates for the fractional maximal operators $\mathcal{M}^\alpha$ on general probability spaces equipped with a tree-like structure. For given $1<p\leq q<\infty$, we study the sharp universal upper bound…

Probability · Mathematics 2025-01-08 Rodrigo Bañuelos , Adam Osękowski

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

Number Theory · Mathematics 2021-06-15 Tianfang Qi , Su Hu

To estimate the optimal constant in Hardy-type inequalities, some variational formulas and approximating procedures are introduced. The known basic estimates are improved considerably. The results are illustrated by typical examples. It is…

Probability · Mathematics 2015-01-15 Mu-Fa Chen

Parameterizing by the largest processing time $p_{max}$ and the number of different job processing times $d$, we propose a proximity technique for High-Multiplicity Scheduling on Uniform Machines for the objectives Makespan Minimization…

Data Structures and Algorithms · Computer Science 2024-09-24 Hauke Brinkop , David Fischer , Klaus Jansen

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

Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…

Symbolic Computation · Computer Science 2016-03-07 Lu Yang , Ju Zhang

We'll measure the differences of the dual variables and the gain of the objective function when creating new problems, which each has one inequality more than the starting LP-instance. These differences of the dual variables are naturally…

Discrete Mathematics · Computer Science 2008-11-21 H. Georg Buesching

In the paper "Bellman function for extremal problems in $\mathrm{BMO}$", the authors built the Bellman function for integral functionals on the $\mathrm{BMO}$ space. The present paper provides a development of the subject. We abandon the…

Analysis of PDEs · Mathematics 2015-10-06 Paata Ivanisvili , Dmitriy M. Stolyarov , Vasily I. Vasyunin , Pavel B. Zatitskiy

The Bohnenblust-Hille inequality for $m$-linear forms was proven in 1931 as a generalization of the famous 4/3-Littlewood inequality. The optimal constants (or at least their asymptotic behavior as $m$ grows) is unknown, but significant for…

Functional Analysis · Mathematics 2019-03-20 F. V. Costa Júnior

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method…

Numerical Analysis · Mathematics 2020-09-28 Andrea Bressan , Michael S. Floater , Espen Sande

In a Banach space $X$ the linear difference equation with constant coefficients $x_{n+p} = a_1x_{n+p-1} +\ldots + a_px_n,$ is Ulam stable if and only if the roots $r_k,$ $1\leq k\leq p,$ of its characteristic equation do not belong to the…

Functional Analysis · Mathematics 2020-07-10 Alina Ramona Baias , Dorian Popa