Bounds for matchings in nonabelian groups

zbMath1439.11036arXiv1702.00905MaRDI QIDQ1627194

William F. Sawin

Publication date: 22 November 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00905

zbMATH Keywords

finite groupssum-free setsslice rank

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extremal set theory (05D05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (6)

Improved bounds for progression-free sets in \(C_8^n\) ⋮ Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science ⋮ Monochromatic equilateral triangles in the unit distance graph ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings ⋮ Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication ⋮ Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication

Cites Work

• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Automorphisms of direct products of finite groups. II.
• On cap sets and the group-theoretic approach to matrix multiplication
• Unnamed Item

This page was built for publication: Bounds for matchings in nonabelian groups