
This paper presents a novel combinatorial theorem that yields improved upper bounds on the density of corner-free sets within quasirandom groups, leading to advancements in understanding the communication complexity of specific functions in the Number-on-Forehead model.


coremsg

improved-upper-bounds-on-the-density-of-corner-free-sets-in-quasirandom-groups-and-applications-to-communication-complexity


Improved Upper Bounds on the Density of Corner-Free Sets in Quasirandom Groups and Applications to Communication Complexity
