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 13639
for questions involving inequalities, upper and lower bounds.
13
votes
2
answers
792
views
Distance of vectors versus distance of their difference vectors
For any given $x \in \mathbb{R}^n$, let $\nabla{x} \in \mathbb{R}^{n \choose 2}$ be the vector whose $\{i,j\}$-th entry is $|x_i-x_j|$. I think the following claim is true.
Claim. If $f, g \in \m …
- 519
2
votes
1
answer
138
views
Lower Bound for $\sum_{\{i,j\}\subseteq \partial S \\ (g_i-g_j)^2 \le1}{(g_i-g_j)^2}$
Let $\emptyset \subsetneq S \subsetneq \{1,\cdots,n\}$ be a set with cardinality $s$, and $g\in\mathbb{R}^n$ be a vector such that
$$\sum_{\{i,j\}\subseteq \{1,\cdots,n\}}{(g_i-g_j)^2} = s(n-s).$$
…
- 519