Bounds for matchings in nonabelian groups

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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, and Umans (2017) gave similar bounds in abelian groups of bounded exponent, and Petrov (2016) gave exponential bounds in certain p-groups.

Original languageEnglish (US)
Article number#P4.23
JournalElectronic Journal of Combinatorics
Volume25
Issue number4
DOIs
StatePublished - Nov 2 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Bounds for matchings in nonabelian groups'. Together they form a unique fingerprint.

Cite this