When do random subsets decompose a finite group?
From MaRDI portal
Publication:2655780
Abstract: Let A,B be two random subsets of a finite group G. We consider the event that the products of elements from A and B span the whole group; i.e. (AB union BA) = G. The study of this event gives rise to a group invariant we call Theta(G). Theta(G) is between 1/2 and 1, and is 1 if and only if the group is abelian. We show that a phase transition occurs as the size of A and B passes sqrt{Theta(G)|G|log|G|}; i.e. for any c>0, if the size of A and B is less than (1-c)sqrt{Theta(G)|G|log|G|}, then with high probability (AB union BA) does not equal G. If A and B are larger than (1+c)sqrt{Theta(G)|G|log|G|} then (AB union BA) equals G with high probability.
Recommendations
Cites work
- A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
- Classical groups, probabilistic methods, and the (2,3)-generation problem
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- New versions of Suen's correlation inequality
- On conjugacy classes of maximal subgroups of finite simple groups, and a related zeta function.
- The probability of generating a finite classical group
Cited in
(2)
This page was built for publication: When do random subsets decompose a finite group?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655780)