Bounds for Matchings in Nonabelian Groups
Bounds for Matchings in Nonabelian Groups
复制标题
非阿贝尔群中的匹配界限
DOI:
--
复制
发表时间:
2017
影响因子:
0.7
通讯作者:
W. Sawin
中科院分区:
文献类型:
--
作者:
W. Sawin
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, and Umans (2017) gave similar bounds in abelian groups of bounded exponent, and Petrov (2016) gave exponential bounds in certain $p$-groups.