Arithmetic Progressions in Abundance by Combinatorial Tools

Simple item page
dc.creatorBeiglboeck, Mathias
dc.date2008-09-10
dc.date.accessioned2026-07-07T10:01:57Z
dc.date.available2026-07-07T10:01:57Z
dc.descriptionUsing the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We present a purely combinatorial argument which allows to derive this result directly from van der Waerden's Theorem.
dc.identifierhttps://arxiv.org/abs/0809.1709
dc.identifierhttp://arxiv.org/abs/0809.1709
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168807
dc.subjectCombinatorics
dc.subject05D10
dc.titleArithmetic Progressions in Abundance by Combinatorial Tools
dc.typetext

Files

Collections

arXiv