Timeline for Controlling iterated sum sets of "most" of $A+B$
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2021 at 0:10 | vote | accept | RFZ | ||
| Nov 18, 2021 at 0:10 | comment | added | RFZ | Great! Thank you so much, Fedor! +1 | |
| Nov 17, 2021 at 4:58 | comment | added | Fedor Petrov | We construct a function from $A+B+nS$ to subsets of $(A+B)^{n+1}$ such that each subset has size at least $\alpha^n$ and these subsets are disjoint. | |
| Nov 16, 2021 at 23:36 | comment | added | RFZ | Dear Fedor! I think that I got your point. But let me ask you a minor a question: I edited my question yesterday when I added an edit but later I deleted but you can see it anyway. So my point was basically to construct some function from $A+B+nS$ to $(n+1)(A+B)$ with desired properties (please see my edit). But in your answer do you construct implicitly some function from $A+B+nS$ to $(A+B)^{n+1}$? I guess no. You claim is that from any element of $A+B+nS$ you can construct $\geq \alpha^n$ elements from $(A+B)^{n+1}$. | |
| Nov 16, 2021 at 8:46 | history | answered | Fedor Petrov | CC BY-SA 4.0 |