New lower bounds for cap sets
New lower bounds for cap sets, Discrete Analysis 2023:20, 18 pp. One of the best known problems in additive combinatorics, the cap set problem, asks how large a subset of $\mathbb F_3^n$ can be if it contains no non-trivial solutions to the equation $x+y+z=0$. (A trivial solution is one where $x=y=...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
2023-12-01
|
| Series: | Discrete Analysis |
| Online Access: | https://doi.org/10.19086/da.91076 |