English

Combinatorial results implied by many zero divisors in a group ring

Combinatorics 2020-04-20 v4 Group Theory

Abstract

It has been recently proved (by Croot, Lev and Pach and the subsequent work by Ellenberg and Gijswijt) that for a group G=G0nG=G_0^n, where G0{1,1}mG_0\ne \{1,-1\}^m is a fixed finite Abelian group and nn is large, any subset AA without 3-progressions (triples x,y,zx,y,z of different elements with xy=z2xy=z^2) contains at most G1c|G|^{1-c} elements, where c>0c>0 is a constant depending only on G0G_0. This is known to be false when GG is, say, large cyclic group. The aim of this note is to show that algebraic property which corresponds to this difference is the following: in the first case a group algebra F[G]\mathbb{F}[G] over suitable field F\mathbb{F} contains a subspace XX with codimension at most X1c|X|^{1-c} such that X3=0X^3=0. We discuss which bounds are obtained for finite Abelian pp-groups and for some matrix pp-groups: Heisenberg group over Fp\mathbb{F}_p and the unitriangular group over Fp\mathbb{F}_p. Also we show how the method works for further generalizations by Kleinberg--Sawin--Speyer and Ellenberg.

Keywords

Cite

@article{arxiv.1606.03256,
  title  = {Combinatorial results implied by many zero divisors in a group ring},
  author = {Fedor Petrov},
  journal= {arXiv preprint arXiv:1606.03256},
  year   = {2020}
}
R2 v1 2026-06-22T14:22:24.689Z