Invariable generation of permutation and linear groups

From MaRDI portal




Abstract: A subset leftx1,x2,hdots,xdight of a group G emph{invariably generates} G if leftx1g1,x2g2,hdots,xdgdight generates G for every d-tuple (g1,g2hdots,gd)inGd. We prove that a finite completely reducible linear group of dimension n can be invariably generated by leftlfloorfrac3n2ightfloor elements. We also prove tighter bounds when the field in question has order 2 or 3. Finally, we prove that a transitive [respectively primitive] permutation group of degree ngeq2 [resp. ngeq3] can be invariably generated by Oleft(fracnsqrtlognight) [resp. Oleft(fraclognsqrtloglognight)] elements.



Cites work







This page was built for publication: Invariable generation of permutation and linear groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1727710)