On the existence of dense substructures in finite groups
Abstract
Fix k ≥ 6. We prove that any large enough finite group G contains k elements which span quadratically many triples of the form (a,b,ab) ∈ S × G, given any dense set S ⊂eq G × G. The quadratic bound is asymptotically optimal. In particular, this provides an elementary proof of a special case of a conjecture of Brown, Erdos and S\'os. We remark that the result was recently discovered independently by Nenadov, Sudakov and Tyomkyn.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.