Open Access

Bounds on the size of Progression-Free Sets in ℤmn

Péter Pál Pach

Péter Pál Pach

  • Department of Computer Science and Information Theory, Budapest University of Technology and EconomicsBudapest, Hungary
  • MTA-BME Lendület Arithmetic Combinatorics Research GroupBudapest, Hungary
Search for this author on
Sciendo|Google Scholar
Pach, Péter Pál
  
May 31, 2022
Bounds on the size of Progression-Free Sets in ℤmn's Cover Image
About this article
Previous Article
Next Article
Cite
Download Cover
Published Online: May 31, 2022
Page range: 1 - 10
Received: Jun 30, 2021
Accepted: Nov 18, 2021
DOI: https://doi.org/10.2478/udt-2022-0005
Keywords
© 2022 Péter Pál Pach, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

In this note we give an overview of the currently known best lower and upper bounds on the size of a subset of ℤnm avoiding k-term arithmetic progression. We will focus on the case when the length of the forbidden progression is 3. We also formulate some open questions.

Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Mathematics, Algebra and Number Theory, Discrete Mathematics, Probability and Statistics, Numerical and Computational Mathematics
Journal RSS Feed