Bounds for matchings in nonabelian groups
The electronic journal of combinatorics, Tome 25 (2018) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

Will Sawin  1

1 Columbia University / Clay Foundation
@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/}
}
TY  - JOUR
AU  - Will Sawin
TI  - Bounds for matchings in nonabelian groups
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7520/
DO  - 10.37236/7520
ID  - 10_37236_7520
ER  - 
%0 Journal Article
%A Will Sawin
%T Bounds for matchings in nonabelian groups
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/7520/
%R 10.37236/7520
%F 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 :