Random generation of associative algebras

DOI10.1112/jlms.12827arXiv2009.01115OpenAlexW3081606493MaRDI QIDQ6199306

Damian Sercombe, Aner Shalev

Publication date: 23 February 2024

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.01115

Mathematics Subject Classification ID

Finite rings and finite-dimensional associative algebras (16P10) Random matrices (algebraic aspects) (15B52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The probability of generating a finite simple group.
• On the smallest number of generators and the probability of generating an algebra
• Random generation of finite and profinite groups and group enumeration.
• Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
• The probability that a matrix be nilpotent
• On the number of matrices with given characteristic polynomial
• The expected number of random elements to generate a finite group.
• How many elements are needed to generate a finite group with good probability?
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• Maximal subalgebras of finite-dimensional algebras
• Probabilistic and Asymptotic Aspects of Finite Simple Groups
• Maximal subgroups in finite and profinite groups
• Cyclic Matrices Over Finite Fields
• The expected number of random elements to generate a finite Abelian group

This page was built for publication: Random generation of associative algebras