Timeline for Iterated sumset inequalities in cancellative semigroups
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2016 at 1:04 | comment | added | Brendan Murphy | Nice notes! I suppose I should have figured you tried this, but I happened to be thinking about commutative graphs for another reason and was reminded of your question. I don't know a way around using Ruzsa's triangle inequality to answer your question. | |
| Feb 23, 2016 at 23:42 | comment | added | zeb | The fact that Petridis's proof of this inequality generalizes to the cancellative case was part of the reason I asked this question - unfortunately, no matter how I tried I could not find a way to use it to prove the general growth bounds I am looking for. (For a completely graph-free proof check out Theorem 7 of my personal notes on the sum-product theorem: math.stanford.edu/~notzeb/sumproduct.pdf) | |
| Feb 23, 2016 at 20:48 | comment | added | Brendan Murphy | The ideas needed to carry this out are contained in a paper of Ruzsa cited in the linked paper, the generalizations in the linked paper are for another purpose. | |
| Feb 23, 2016 at 20:42 | history | answered | Brendan Murphy | CC BY-SA 3.0 |