Abundance of arithmetic progressions in some combiantorially large sets
Combinatorics
2019-08-12 v2
Abstract
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result was extended for arbitrary semigroups by Bergelson and Hindman, again using the structure of Stone-Cech compactification of general semigroup. However they provided the abundances for various types of large sets. But the abundances in in many large sets is still unknown. In this work we will provide the abundance in Quasi Central sets, J-sets and C-sets.
Cite
@article{arxiv.1904.09515,
title = {Abundance of arithmetic progressions in some combiantorially large sets},
author = {Pintu Debnath and Sayan Goswami},
journal= {arXiv preprint arXiv:1904.09515},
year = {2019}
}
Comments
6 page, The previous file has been replaced