Maximal subsets free of arithmetic progressions in arbitrary sets


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length k in a given set of size n is considered. It is proved that it is sufficient, in a certain sense, to consider the interval [1,..., n]. The study continues the work of Komlós, Sulyok, and Szemerédi.

About the authors

A. S. Semchankau

Moscow Institute of Physics and Technology (State University)

Author for correspondence.
Email: leshaxim@mail.ru
Russian Federation, Dolgoprudnyi, Moscow Oblast

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.