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 and , 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 which contain no right angles. More precisely, let be a fixed odd prime power and be the standard inner product of two vectors , we prove that the maximum cardinality of a subset without three distinct elements satisfying is at most . For sufficiently large , our result significantly improves the previous upper bound of Bennett (European J. Combin., 70:155--163, 2018.), who showed that .
Recommendations
- Right angle free subsets in the plane
- The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
- Subsets of without L-shaped configurations
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- Maximum subsets of \((0,1]\) with no solutions to \(x+y = kz\)
- Large dimensional sets not containing a given angle
- On the maximum number of isosceles right triangles in a finite point set
- Occurrence of right angles in vector spaces over finite fields
- A note on a problem of Erdős on right angles
- scientific article; zbMATH DE number 800308
Cites work
- Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture
- How large dimension guarantees a given angle?
- scientific article; zbMATH DE number 3848141 (Why is no real title available?)
- New applications of the polynomial method: the cap set conjecture and beyond
- Occurrence of right angles in vector spaces over finite fields
- On a problem of Erdős on fractal combinatorial geometry
- On cap sets and the group-theoretic approach to matrix multiplication
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On sunflowers and matrix multiplication
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- The growth of tri-colored sum-free sets
- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
- Universal points in the asymptotic spectrum of tensors
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
Cited in
(5)- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
- Monochromatic equilateral triangles in the unit distance graph
- Avoiding right angles and certain Hamming distances
- scientific article; zbMATH DE number 7731180 (Why is no real title available?)
- Partition rank and partition lattices
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)