Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Abundance of arithmetic progressions in some combiantorially large sets (1904.09515v2)

Published 20 Apr 2019 in math.CO

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.

Summary

We haven't generated a summary for this paper yet.