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 | |
Results tagged with inequalities
Search options not deleted
user 16976
for questions involving inequalities, upper and lower bounds.
0
votes
1
answer
127
views
upper bound involving recursions
Suppose that I have the following recursion for all $a_k >1$: $a_{k+1}^2 \leq a_k^2 - a_k$. Then one can see that the following inequality is true (proved via induction): $a_k \leq a_0 - \frac{k}{2}$. …
- 519
2
votes
1
answer
251
views
Log-Sobolev constant
Let $\nu \propto e^{-f}$ be a probability density on $\mathbb{R}^d$ with full support. We say $\nu$ satisfies the log-Sobolev inequality (LSI) with constant $\alpha$ if for every smooth function $g:\m …
- 519