Global ETD Search

Games, Graphs, and Groups

Versteegen, LeoUniversity of Cambridge2024

… the commonness property for hypergraphs. A set $A\subset \mathbb{F}_p^n$ is *sum-free* if it contains no elements $x$, $y$, and $z$ such that $x+y=z$. If $p\equiv 2 \mod 3$, the maximal size of a sum-free in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. In Chapter 4, we show that if a …

cambridge Repository record for Games, Graphs, and Groups (opens in a new tab)