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

不含直角的$\mathbb{F}^n_q$的最大子集

Maximum subsets of $\mathbb{F}^n_q$ containing no right angles

Gennian Ge, Chong Shangguan

摘要:

最近,Croot,Lev和Pach(数学,185:331--337,2017.)和Ellenberg和Gijswijt(数学,185:339--443,2017.)提出了一种新的多项式方法,并利用它分别证明了$\mathbb{Z}_4^n$和$\mathbb{F}_3^n$中三项算术级数自由集的上界.他们的方法后来被Tao总结,现在被称为切片排名方法。本文利用这种方法得到了$\mathbb{F}^n_q$中不含直角的子集的基数的一个新的上界。更精确地说,设$q$是一个固定的奇素数幂,$x\cdot y$是两个向量$x,y\in\mathbb{F}_q^n$的标准内积,我们证明了不含三个不同元素$x,y,z\in A$的子集$A\subseteq\mathbb{F}_q^n$满足$(z-x)\cdot (y-x)=0$的最大基数至多为$\binom{n+q}{q-1}+3$ .对于足够大的$n$,我们的结果显著地改进了Bennett(European J. Combin.,70:155--163,2018.),展示了$|A|=\mathcal{O}(q^{\frac{n+2}{3}})$。

英文摘要:

Recently, Croot, Lev, and Pach (Ann. of Math., 185:331--337, 2017.) and Ellenberg and Gijswijt (Ann. of Math., 185:339--443, 2017.) developed a new polynomial method and used it to prove upper bounds for three-term arithmetic progression free sets in $\mathbb{Z}_4^n$ and $\mathbb{F}_3^n$, respectively. Their approach was later summarized by Tao and is now known as the slice rank method. In this paper, we apply this method to obtain a new upper bound on the cardinality of subsets of $\mathbb{F}^n_q$ which contain no right angles. More precisely, let $q$ be a fixed odd prime power and $x\cdot y$ be the standard inner product of two vectors $x,y\in\mathbb{F}_q^n$, we prove that the maximum cardinality of a subset $A\subseteq\mathbb{F}_q^n$ without three distinct elements $x,y,z\in A$ satisfying $(z-x)\cdot (y-x)=0$ is at most $\binom{n+q}{q-1}+3$. For sufficiently large $n$, our result significantly improves the previous upper bound of Bennett (European J. Combin., 70:155--163, 2018.), who showed that $|A|=\mathcal{O}(q^{\frac{n+2}{3}})$.

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

↑