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

Erdős不同和问题的变体与方差方法

Variants of the Erdős distinct sums problem and variance method

Simone Costa, Stefano Della Fiore, Andrea Ferraguti

AI总结:

本文推广了Erdős不同和问题,研究整数格点序列上对称多项式在限定大小子序列上的非零取值互异性,通过方差方法得到了坐标取值范围M的下界。

摘要:

设$\Sigma=\{a_1, \ldots , a_n\}$是一个正整数集合,满足$a_1 < \ldots < a_n$,且所有$2^n$个子集和两两不同。Erdős的一个著名猜想指出,存在常数$C$使得$a_n>C\cdot 2^n$,而目前已知的最佳结果为$a_n>C\cdot 2^n/\sqrt{n}$的形式。本文提出了Erdős不同和问题的一个推广,其思路与近期文献\cite{CGS}和\cite{CS}中引入的Davenport常数及Erdős-Ginzburg-Ziv常数的推广思路一致。更具体地,将$\Sigma$视为$\mathbb{Z}^k$中的序列,每个$a_i$的每个坐标都在$[0,M]$内,我们要求$m$次对称多项式在大小至多为$\lambda n$的$\Sigma$子序列上的非零取值全部互不相同,其中$\lambda\in (0,1]$为给定参数。若$\mathcal{F}_{\lambda,n}$表示$[1,n]$中大小至多为$\lambda n$的子集族,我们的主要结果是:对每个$k,m$和$\lambda$,存在显式常数$C_{k,m,\lambda}$,使得$$ M\geq C_{k,m,\lambda} \frac{(1+o(1)) |\mathcal{F}_{\lambda,n}|^{\frac{1}{mk}}}{n^{1 - \frac{1}{2m}}}.$$

英文摘要:

Let $Σ=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erdős states that $a_n>C\cdot 2^n$ for some constant $C$, while the best result known to date is of the form $a_n>C\cdot 2^n/\sqrt{n}$. In this paper, we propose a generalization of the Erdős distinct sum problem that is in the same spirit as those of the Davenport and the Erdős-Ginzburg-Ziv constants recently introduced in \cite{CGS} and in \cite{CS}. More precisely, we require that the non-zero evaluations of the $m$-th degree symmetric polynomial are all distinct over the subsequences of $Σ$ whose size is at most $λn$, for a given $λ\in (0,1]$, considering $Σ$ as a sequence in $\mathbb{Z}^k$ with each coordinate of each $a_i$ in $[0,M]$. If $\mathcal{F}_{λ,n}$ denotes the family of subsets of $[1,n]$ whose size is at most $λn$, our main result is that, for each $k,m,$ and $λ$, there exists an explicit constant $C_{k,m,λ}$ such that $$ M\geq C_{k,m,λ} \frac{(1+o(1)) |\mathcal{F}_{λ,n}|^{\frac{1}{mk}}}{n^{1 - \frac{1}{2m}}}.$$

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

↑