Maximum subsets of F^n_q containing no right angles

From MaRDI portal
Publication:2021406



Abstract: 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 mathbbZ4n and mathbbF3n, 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 mathbbFqn which contain no right angles. More precisely, let q be a fixed odd prime power and xcdoty be the standard inner product of two vectors x,yinmathbbFqn, we prove that the maximum cardinality of a subset AsubseteqmathbbFqn without three distinct elements x,y,zinA satisfying (z−x)cdot(y−x)=0 is at most . 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|=mathcalO(qfracn+23).












This page was built for publication: Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021406)