Random generators of given orders and the smallest simple Moufang loop

Simple item page
dc.creatorVojtěchovský, Petr
dc.date2007-01-24
dc.date.accessioned2026-07-07T07:42:51Z
dc.date.available2026-07-07T07:42:51Z
dc.descriptionThe probability that $m$ randomly chosen elements of a finite power associative loop $C$ have prescribed orders and generate $C$ is calculated in terms of certain constants related to the action of $Aut(C)$ on the subloop lattice of $C$. As an illustration, all meaningful probabilities of random generation by elements of given orders are found for the smallest nonassociative simple Moufang loop.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0701703
dc.identifierhttp://arxiv.org/abs/math/0701703
dc.identifierAlgebra Universalis 50 (2003), 27-33
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122603
dc.subjectGroup Theory
dc.subject20N05, 20F05, 06B99
dc.titleRandom generators of given orders and the smallest simple Moufang loop
dc.typetext

Files

Collections

arXiv