Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
for questions involving inequalities, upper and lower bounds.
4
votes
$L^p$ domination of mixed partial derivatives of the 3rd order by the unmixed ones?
I think similar questions always translate in the $L^p$ boundedness of a Fourier multiplier. In this case you want a Fourier multiplier which "exchanges the operator $D_1D_2D_3$ with the operator $D_1 …
3
votes
$L^p$ domination of mixed partial derivatives by the unmixed ones?
It should be true for $p>1$. For a function $\varphi$ in the Schwartz class it holds that \begin{equation}
D_1D_2 \varphi(x) = -R_1 R_2 \Delta \varphi(x),
\end{equation}
where $R_1, R_2$ are the Riesz …
1
vote
Accepted
A counterexample showing $BV_p \neq AC_p$
So first of all, what is claimed in Love's paper is slightly different, It says that for a sufficient large choice of the parameter $c>0$ the function
$$ g(x): = \sum_{n=0}^\infty c^{-n/p}\cos(c^n \pi …
7
votes
3
answers
686
views
A generalization of discrete Hilbert's transform (Montgomery's inequality)
In the paper "Hilbert's inequality", Montgomery and Vaughan proved that a generalization of the discrete Hilbert transform is bounded in $\ell^2$. The inequality reads as follows
$$ \Big| \sum_{k\neq …
0
votes
Accepted
Isoperimetric inequality for analytic functions on an annulus
You can probably prove that
$$ \Big( \int_\mathbb{A_r} |f(z)|^2 \frac{dxdy}{\pi(1-r^2)} \Big)^{1/2} \leq \int_{ \mathbb{T}} |f(e^{i\theta})| \frac{d\theta}{2\pi}+\int_{ \mathbb{T_r}} |f(re^{i\theta}) …
4
votes
Accepted
Proof of a discrete isoperimetric inequality
Suppose you have a power series with coefficients $a_n$
$$ f(z):= \sum_{k=1}^\infty a_k z^k .$$
Then the coefficients of $f^2$ are exactly $c_n$. Also if we denote by $\odot$ the Hadamard multiplicati …
2
votes
An "obvious" probability lemma about random words
I think it is easier if you rewrite your inequality as
\begin{align}
& P( \bigcap_{i=1}^{s-1}A_i ) - P ( \bigcap_{i=1}^{s-1}A_i \cap A_s) \geq P(\bigcap_{i=1}^{s-1}A_i)(1-P(A_s)) \\
& \iff P(A_s …