An elementary proof that finite groups lack unique product structures
From MaRDI portal
A slick combinatorial argument is given to prove that if \(G\) is a nontrivial finite group and if \(m\geq 2\) is a fixed integer, then there is no subset \(S\) of \(G\) such that the map \(\Phi:S^m\to G\), defined by \(\Phi(a_1,a_2,\dots,a_m)=a_1a_2\dots a_m\) is a bijection. This result was previously obtained by \textit{D. Dimovski} [J. Algebra 146, No. , 205-209 (1992; Zbl 0752.20038)] using character theory.
Recommendations
Cited in
(2)
This page was built for publication: An elementary proof that finite groups lack unique product structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1911644)