  We give upper bounds for triples of subsets of a finite group such that the
triples of elements that multiply to 1 form a perfect matching. Our bounds are
the first to give exponential savings in powers of an arbitrary finite group.
Previously, Blasiak-Church-Cohn-Grochow-Naslund-Sawin-Umans gave similar bounds
in abelian groups of bounded exponent, and Petrov gave exponential bounds in
certain p-groups.

Combinatorics