arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.04490math.COmath.NT
收藏

任意集合中无等差数列的极大子集

Maximal subsets free of arithmetic progressions in arbitrary sets

Aliaksei Semchankau

摘要:

考虑在给定的长度为$n$的集合中,确定不含长度为$k$的等差数列的子集的最大基数问题.证明了在一定意义下考虑区间$[1,\dots, n]$是充分的。这项研究延续了科姆洛斯、苏约克和塞梅雷迪的工作。

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑