arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.12372math.CO
收藏

$\mathcal{CR}$-集中等差数列的丰富性

Abundance of arithmetic progressions in $\mathcal{CR}$-sets

Dibyendu De, Pintu Debnath

AI总结:

本文证明对于任意CR-集A⊆N,包含其l项等差数列的集合{(a,b):{a,a+b,...,a+lb}⊂A}在(N×N,+)中也是CR-集,推广了J-集的类似结果。

摘要:

H.Furstenberg和E.Glasner证明了对于任意$k\in\mathbb{N}$,任何分段 syndetic 的整数集合都包含一个$k$项等差数列,且此类等差数列的集合本身在$\mathbb{Z}$中是分段 syndetic 的。上述结果由V. Bergelson和N. Hindman利用离散半群的Stone-Čech紧化代数推广到了任意半群。然而,他们为各种类型的大集合提供了丰富性。在\cite{DHS}中,第一作者、Neil Hindman和Dona Strauss引入了两种大集合的概念,即$J$-集和$C$-集。在\cite{BG}中,V. Bergelson和D. Glasscock引入了另一种大集合的概念,该概念与$J$-集的概念类似,即$\mathcal{CR}$-集。所有这些集合都包含任意长度的等差数列。在\cite{DG}中,第二作者和S. Goswami证明了对于任何$J$-集$A\subseteq\mathbb{N}$,集合$\{(a,b):\{a,a+b,a+2b,\ldots,a+lb\}\subset A\}$在$(\mathbb{N\times\mathbb{N}},+)$中是$J$-集。在本文中,我们证明了$\mathcal{CR}$-集也具有同样的性质。

英文摘要:

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in $\mathbb{Z}.$ The above result was extended for arbitrary semigroups by V. Bergelson and N. Hindman, using the algebra of the Stone-Čech compactification of discrete semigroups. However, they provided an abundance for various types of large sets. In \cite{DHS}, the first author, Neil Hindman and Dona Strauss introduced two notions of large sets, namely, $J$-set and $C$-set. In \cite{BG}, V. Bergelson and D. Glasscock introduced another notion of largeness, which is analogous to the notion of $J$-set, namely $\mathcal{CR}$- set. All these sets contain arithmetic progressions of arbitrary length. In \cite{DG}, the second author and S. Goswami proved that for any $J$-set, $A\subseteq\mathbb{N}$, the collection $\{(a,b):\,\{a,a+b,a+2b,\ldots,a+lb\}\subset A\}$ is a $J$-set in $(\mathbb{N\times\mathbb{N}},+)$. In this article, we prove the same for $\mathcal{CR}$-sets.

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

↑