On sets of integers not containing long arithmetic progressions

Simple item page
dc.creatorLaba, Izabella
dc.creatorLacey, Michael T.
dc.date2001-08-22
dc.date.accessioned2026-07-07T04:43:05Z
dc.date.available2026-07-07T04:43:05Z
dc.descriptionWe construct subsets of {1,...,N} of cardinality at least N exp(-C(log N)^{1/(k+1)}) which do not contain arithmetic progressions of length 2^k+1. This extends a result of Behrend (1946) concerning sets which do not contain aritmetic progressions of length 3.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0108155
dc.identifierhttp://arxiv.org/abs/math/0108155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62064
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.titleOn sets of integers not containing long arithmetic progressions
dc.typetext

Files

Collections

arXiv