Long Arithmetic Progressions in Critical Sets

Simple item page
dc.creatorCroot, Ernie
dc.date2004-03-03
dc.date2004-03-05
dc.date.accessioned2026-07-07T05:05:55Z
dc.date.available2026-07-07T05:05:55Z
dc.descriptionIn this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an arithmetic progression of length at least log^{1/4+o(1)} x.
dc.descriptionClarified introduction
dc.identifierhttps://arxiv.org/abs/math/0403082
dc.identifierhttp://arxiv.org/abs/math/0403082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70353
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11P70; 05D99
dc.titleLong Arithmetic Progressions in Critical Sets
dc.typetext

Files

Collections

arXiv