The slice-rank conjecture for group multiplication tensors

Let GG be a finite group, let M(G)M(G) denote its matching number, and define the minimum slice rank

SR(G)=minkSR(Tk[G]),\operatorname{SR}(G)=\min_k \operatorname{SR}(T_{k[G]}),

where the minimum is over algebraically closed fields kk and Tk[G]T_{k[G]} is the multiplication tensor of the group algebra k[G]k[G]. The slice-rank conjecture. One has

SR(G)M(G)Go(1).\operatorname{SR}(G)\leq M(G)\cdot |G|^{o(1)}.

This would make the minimum slice rank of the group multiplication tensor essentially controlled by the largest matching in the group and would yield corresponding slice-rank bounds for matching problems in groups. The source describes this as a conjecture slightly weaker than one previously proposed by Petrov; no resolution is supplied here.

Sources & referencesView supporting material

Primary source

Kevin Pratt, “A Note on Slice Rank and Matchings in Groups”, arXiv:2210.05488 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.