Bounds for matchings in nonabelian groups (Q1627194)

From MaRDI portal
Revision as of 11:35, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q282847)
scientific article
Language Label Description Also known as
English
Bounds for matchings in nonabelian groups
scientific article

    Statements

    Bounds for matchings in nonabelian groups (English)
    0 references
    22 November 2018
    0 references
    Summary: 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, \textit{J. Blasiak} et al. [Discrete Anal. 2017, Paper No. 3, 27 p. (2017; Zbl 1405.65058)] gave similar bounds in abelian groups of bounded exponent, and \textit{F. Petrov} [``Combinatorial results implied by many zero divisors in a group ring'', Preprint, \url{arXiv:1606.03256}] gave exponential bounds in certain \(p\)-groups.
    0 references
    finite groups
    0 references
    sum-free sets
    0 references
    slice rank
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references