Timeline for Eccentricity in the number of representations for sets too large to be Sidon sets
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 18, 2019 at 2:36 | vote | accept | Joseph Vandehey | ||
| Sep 12, 2019 at 11:11 | answer | added | LeechLattice | timeline score: 4 | |
| Sep 11, 2019 at 2:49 | comment | added | Joseph Vandehey | Unfortunately the $\epsilon$'s I am working with are around $.4$ to $.6$, so that bound isn't helpful. | |
| Sep 10, 2019 at 5:54 | comment | added | Seva | Since we have $r_A(n)≥2$ for all $n\in 2A$ with very few exceptions, your $E(A)$ is essentially equal to the sum of $r_A(n)−2$, which is $$\sum_{n\in 2A} r_A(n)−2\sum_{n\in 2A}1=|A|^2−2|2A|>(1+\varepsilon)^2N−4N; $$ does this answer your question if $\varepsilon$ is not too small? | |
| Sep 9, 2019 at 5:18 | history | asked | Joseph Vandehey | CC BY-SA 4.0 |