Bounds for Matchings in Nonabelian Groups
暂无分享，去创建一个
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.
[1] Fedor Petrov. Many Zero Divisors in a Group Ring Imply Bounds on Progression--Free Subsets , 2016 .
[2] M. Ziegler. Volume 152 of Graduate Texts in Mathematics , 1995 .
[3] James Aaronson,et al. A connection between matchings and removal in abelian groups , 2016 .
[4] Ernie Croot,et al. Progression-free sets in Z_4^n are exponentially small , 2016, 1605.01506.
[5] Joshua A. Grochow,et al. On cap sets and the group-theoretic approach to matrix multiplication , 2016, ArXiv.