Bounds for matchings in nonabelian groups (Q1627194): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On cap sets and the group-theoretic approach to matrix multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automorphisms of direct products of finite groups. II. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4126536 / rank | |||
Normal rank | |||
Latest revision as of 10:48, 17 July 2024
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
