On distinct consecutive differences
| dc.creator | Solymosi, J. | |
| dc.date | 2005-03-03 | |
| dc.date.accessioned | 2026-07-07T05:17:39Z | |
| dc.date.available | 2026-07-07T05:17:39Z | |
| dc.description | We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to the constant multiplier. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0503069 | |
| dc.identifier | http://arxiv.org/abs/math/0503069 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/74381 | |
| dc.subject | Combinatorics | |
| dc.subject | Number Theory | |
| dc.subject | 05D10 | |
| dc.title | On distinct consecutive differences | |
| dc.type | text |