电邮这篇文章 Maximal subsets free of arithmetic progressions in arbitrary sets
- 作者: Semchankau A.S.1
-
隶属关系:
- Moscow Institute of Physics and Technology (State University)
- 期: 卷 102, 编号 3-4 (2017)
- 页面: 396-402
- 栏目: Article
- URL: https://ogarev-online.ru/0001-4346/article/view/150115
- DOI: https://doi.org/10.1134/S0001434617090097
- ID: 150115
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
A. Semchankau
Moscow Institute of Physics and Technology (State University)
编辑信件的主要联系方式.
Email: leshaxim@mail.ru
俄罗斯联邦, Dolgoprudnyi, Moscow Oblast
补充文件
