A note on Elkin's improvement of Behrend's construction
| dc.creator | Green, Ben | |
| dc.creator | Wolf, Julia | |
| dc.date | 2008-10-05 | |
| dc.date.accessioned | 2026-07-07T10:07:40Z | |
| dc.date.available | 2026-07-07T10:07:40Z | |
| dc.description | We provide a short proof of a recent result of Elkin in which large subsets of the integers 1 up to N free of 3-term progressions are constructed. | |
| dc.description | 4 pages, submitted to volume in honour of Mel Nathanson | |
| dc.identifier | https://arxiv.org/abs/0810.0732 | |
| dc.identifier | http://arxiv.org/abs/0810.0732 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170721 | |
| dc.subject | Combinatorics | |
| dc.subject | Number Theory | |
| dc.title | A note on Elkin's improvement of Behrend's construction | |
| dc.type | text |