Sets with arithmetic progressions are abundant
Aninda Chakraborty, Sayan Goswami

TL;DR
This paper proves that various large sets, including those with unsettled properties like J-sets and C-sets, are rich in arithmetic progressions, demonstrating their abundance of such progressions.
Contribution
The paper provides an elementary proof that sets of A.P. rich contain arbitrarily long arithmetic progressions, extending known results to broader classes of sets.
Findings
Sets of A.P. rich contain arbitrarily long arithmetic progressions.
Elementary proof established for the abundance of progressions in these sets.
Includes sets like J-sets, C-sets, D-sets, previously with unsettled properties.
Abstract
Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is still unsettled like J-sets, C-sets, D-sets etc. But all of these sets have a common property that they contains arbitrary length of arithmatic progressions. These type of sets are called sets of A.P. rich, we have given an elementary proof of abundance of those sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Graph Labeling and Dimension Problems
SETS WITH ARITHMETIC PROGRESSIONS ARE ABUNDANT
ANINDA CHAKRABORTY AND SAYAN GOSWAMI
Government General Degree College at Chapra
Department of Mathematics,University of Kalyani
Abstract.
Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is still unsettled like J-sets, C-sets, D-sets etc. But all of these sets have a common property that they contains arbitrary length of arithmatic progressions. These type of sets are called sets of A.P. rich, we have given an elementary proof of abundance of those sets.
Key words and phrases:
Arithmetic progressions, notion of largeness of sets
The second author of the paper is supported by UGC-JRF fellowship.
1. introduction
One of the famous Ramsey theoretic results is so called Van der Waerden’s Theorem which guarantees that atleast one cell of any partition of contains arithmetic progressions of arbitrary length. Since arithmetic progressions are invariant under shifts, it follows that every piecewise syndetic set contains arbitrarily long arithmetic progressions.
Theorem 1**.**
Given any , there exists , such that for any partition of , atleast one of the partition contains an length arithmetic progressions.
In various times, mathematicians studied abundance in progression in different types of large sets Like **syndetic sets, central sets, thick sets, piecewise syndetic sets **etc. we have seen many abundance results from [FG], [GJ], [HS], [BH] etc. All of this results shows that if A\subseteq\mathbb{N}\text{ or S}, (Where S is any countable commutative semigroup) be large in some sense then some special configuration contained in those sets are also large in some sense. However, there also remains types of large sets where abundance are yet to be explicate, like **C-sets, D-sets, J-sets **etc.
All of these aforementioned sets have a common property: They all contain arbitrary length of arithmatic progressions, this type of sets are called sets of A.P. rich. Here we have given easiest elementary combinatorial proof of abundance for these type of sets. Also we have seen that if is a set of A.P. rich, then it is set of A.P. rich of all order.
Throughout this paper, is a countable commutative semigroup. Although sometimes countability or commutativity does not appear in the proof.
2. Main results
Theorem 2**.**
Let is any semigroup. Then If is a set of A.P. rich, then
[TABLE]
is a set of A.P. rich.
Proof.
Now as contains arithmatic progression of arbitrary length, fixed and for any , it must contains arithmatic progression of length , which implies that , which shows that contains
[TABLE]
∎
This proves the theorem.
Suppose, for any , be the subsemigroup of defined by:
[TABLE]
Now we derive a result which is one of the main application of [BH] for some large sets.
Corollary 3**.**
Let be a cancellative semigroup and is a set of A.P. rich, then is also a set of A.P. rich.
Proof.
Take the semigroup epimorphism, defined by, . Then for any is A.P. rich, from 2 is also a set of A.P. rich. So, for any length arithmatic progression
[TABLE]
in , we have
[TABLE]
Which concludes the result. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bel] Mathias Beiglboeck, Arithmetic Progressions In Abundance By Combinatorial Tools, Proc. Amer. Math. Soc. 137 (2009), no. 12, 3981-3983.
- 2[1]
- 3[2]
- 4[BG] V. Bergelson, D. Glasscock,On the interplay between additive and multiplicative largeness and its combinatorial applications, ar Xiv:1610.09771
- 5[3]
- 6[4]
- 7[BH] V.Bergelson, N.Hindman. Partition regular structures contained in large sets are abundant. J. Combin. Theory ser. A, 93(1): 18-36, 2001.
- 8[5]
