Translation-invariant equations in $\mathbb{F}_p^n$ and groups
In this paper, we explore how large a subset of a finite group can be without containing non-trivial solutions to linear equations of the form $aX+bY=cZ+dU$ (where $a+b=c+d$). These equations naturally generalize the classic concept of Sidon sets. Using Tao's slice rank method, we first establish strict upper bounds fo...