Related papers: Optimal Weak Parallelogram Constants for $L^p$ Spa…

For the Lagrange interpolation over a triangular domain, we propose an efficient algorithm to rigorously evaluate the interpolation error constant under the maximum norm by using the finite element method (FEM). In solving the optimization…

Motived by the heat flow and bubble analysis of biharmonic mappings, we study further regularity issues of the fourth order Lamm-Riviere system $$\Delta^{2}u=\Delta(V\cdot\nabla u)+{\rm div}(w\nabla u)+(\nabla\omega+F)\cdot\nabla u+f$$ in…

We obtain sharp two-sided inequalities between $L^p-$norms $(1<p<\infty)$ of functions $Hf$ and $H^*f$, where $H$ is the Hardy operator, $H^*$ is its dual, and $f$ is a nonnegative measurable function on $(0,\infty).$ In an equivalent form,…

Let $M_{G}$ be the centered Hardy-Littlewood maximal operator on a finite graph $G$. We find $\underset{p\to \infty}{\lim}\|M_{G}\|_{p}^{p }$ when $G$ is the start graph ($S_n$) and the complete graph ($K_n$), and we fully describe…

Let $C(k,p)$ denote the smallest real number such that the estimate $|a_k|\leq C(k,p)\|f\|_{H^p}$ holds for every $f(z)=\sum_{n\geq0}a_n z^n$ in the $H^p$ space of the unit disc. We compute $C(2,p)$ for $0<p<1$ and $C(3,2/3)$, and identify…

It is well known that the weak ($1,1$) bounds doesn't hold for the strong maximal operators, but it still enjoys certain weak $L\log L$ type norm inequality. Let $\Phi_n(t)=t(1+(\log^+t)^{n-1})$ and the space $L_{\Phi_n}({\mathbb R^{n}})$…

Compressed sensing is a new scheme which shows the ability to recover sparse signal from fewer measurements, using $l_1$ minimization. Recently, Chartrand and Staneva shown in \cite{CS1} that the $l_p$ minimization with $0<p<1$ recovers…

We obtain a series improvement to higher-order $L^p$-Rellich inequalities on a Riemannian manifold $M$. The improvement is shown to be sharp as each new term of the series is added.

For $p \in (1,\infty)\setminus \{2\}$, some properties of the space $\mathscr{M}_p$ of multipliers on $\ell^p_A$ are derived. In particular, the failure of the weak parallelogram laws and the Pythagorean inequalities is demonstrated for…

In this paper, we will use a suitable tranform to investigate the sharp constants and optimizers for the following Caffarelli-Kohn-Nirenberg inequalities for a wide range of parameters $(r,p,q,s,\mu,\sigma)$ and $0\leq a\leq1$:…

In this paper we provide an explicit formula for the optimal lower bound of Donaldson's J-functional, in the sense of finding explicitly the optimal constant in the definition of coercivity, which always exists and takes negative values in…

The weak and strong comparison principles, respectively, are investigated for quasi-linear elliptic boundary value problems with the $p$-Laplacian in one space dimension. We treat the degenerate case of $2 < p < \infty$ and allow also for…

In 2003, Del Pino and Dolbeault [14] and Gentil [19] investigated, independently, best constants and extremals associated to Euclidean Lp-entropy inequalities for p > 1. In this work, we present some contributions in the Riemannian context.…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…

The real anisotropic Littlewood's $4 / 3$ inequality is an extension of a famous result obtained in 1930 by J. E. Littlewood. It asserts that, for $a , b \in ( 0 , \infty )$, the following conditions are equivalent: $\bullet$ There is an…

A search for $C\!P$ violation in the $\overline{B}^0 \to \overline{K}^{*0}\mu^+\mu^-$ decay is performed using proton--proton collision data collected by the LHCb experiment during Run 1 and Run 2, corresponding to an integrated luminosity…

Hypergraph products are quantum low-density parity-check (LDPC) codes constructed from two classical LDPC codes. Although their dimension and distance depend only on the parameters of the underlying classical codes, optimizing their…

The compatibility constant plays an important role in evaluating the prediction error of the lasso in high-dimensional settings. However, the computation of the compatibility constant is generally difficult because it is a complicated…

The $\ell_p$ linear regression problem is to minimize $f(x)=||Ax-b||_p$ over $x\in\mathbb{R}^d$, where $A\in\mathbb{R}^{n\times d}$, $b\in \mathbb{R}^n$, and $p>0$. To avoid overfitting and bound $||x||_2$, the constrained $\ell_p$…

The usual Sobolev inequality in $\mathbb{R}^N$, asserts that $\|\nabla u\|_{L^p(\mathbb{R}^N)} \geq \mathcal{S}\|u\|_{L^{p^*}(\mathbb{R}^N)}$ for $1<p<N$ and $p^*=\frac{pN}{N-p}$, with $\mathcal{S}$ being the sharp constant. Based on a…