Timeline for An inequality for rearrangement-style sums
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2019 at 5:24 | comment | added | darij grinberg | Unfortunately, while it has a name, it has no really well-explained proof anywhere in the literature :( The question I linked has an answer, but understanding it is no easier than solving it oneself. | |
| Feb 24, 2019 at 5:20 | comment | added | Fedor Petrov | @darijgrinberg ah yes, I did not know it has a name and was discussed here | |
| Feb 24, 2019 at 2:03 | comment | added | darij grinberg | Thank you! And, for future readers' sake: You are using the rearrangement inequality for multiple sequences in your first paragraph. | |
| Feb 24, 2019 at 2:02 | vote | accept | darij grinberg | ||
| Feb 23, 2019 at 21:56 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
deleted 5 characters in body
|
| Feb 23, 2019 at 21:53 | comment | added | Fedor Petrov | @darijgrinberg $m_r\geqslant a_i b_j c_r\geqslant \alpha \beta \gamma$, no? | |
| Feb 23, 2019 at 20:55 | comment | added | darij grinberg | Thanks. Any chance you could detail the argument for $m_r \geq \alpha\beta\gamma$ ? | |
| Feb 23, 2019 at 19:48 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 60 characters in body
|
| Feb 23, 2019 at 19:47 | comment | added | Fedor Petrov | @darijgrinberg I mean that the permutations on the left are chosen so that $(a_i),(b_{\sigma(i)}),(c_{\tau(i)})$ are equally sorted. | |
| Feb 23, 2019 at 19:14 | comment | added | darij grinberg | I am not sure why you can WLOG assume the tuples to be equally sorted. Replacing $b_i$ by $b_{\sigma\left(i\right)}$ changes the RHS, too! | |
| Feb 23, 2019 at 11:28 | history | answered | Fedor Petrov | CC BY-SA 4.0 |