Bounds for matchings in nonabelian groups
The electronic journal of combinatorics, Tome 25 (2018) no. 4
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.
DOI :
10.37236/7520
Classification :
11B30, 05B10, 05D05, 20D60
Mots-clés : finite groups, sum-free sets, slice rank
Mots-clés : finite groups, sum-free sets, slice rank
Affiliations des auteurs :
Will Sawin  1
@article{10_37236_7520,
author = {Will Sawin},
title = {Bounds for matchings in nonabelian groups},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {4},
doi = {10.37236/7520},
zbl = {1439.11036},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7520/}
}
Will Sawin. Bounds for matchings in nonabelian groups. The electronic journal of combinatorics, Tome 25 (2018) no. 4. doi: 10.37236/7520
Cité par Sources :