Bounds for Matchings in Nonabelian Groups
classification
🧮 math.CO
keywords
boundsexponentialfinitegavegivegroupgroupstriples
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.