Permutations with Restricted Cycle Structure and an Algorithmic Application
From MaRDI portal
Publication:4796014
DOI10.1017/S0963548302005217zbMath1012.60009WikidataQ56987960 ScholiaQ56987960MaRDI QIDQ4796014
Alice C. Niemeyer, Cheryl E. Praeger, Robert Beals, Seress, Ákos, Charles R. Leedham-Green
Publication date: 20 March 2003
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (13)
Finding involutions in finite Lie type groups of odd characteristic. ⋮ Proportions of elements with given 2-part order in finite classical groups of odd characteristic. ⋮ FINDING INVOLUTIONS WITH SMALL SUPPORT ⋮ Symmetric functions, generalized blocks, and permutations with restricted cycle structure ⋮ On the maximum orders of elements of finite almost simple groups and primitive permutation groups ⋮ Fast recognition of alternating groups of unknown degree. ⋮ Permutations with orders coprime to a given integer ⋮ On the Number ofp-Regular Elements in Finite Simple Groups ⋮ On semiregular permutations of a finite set ⋮ Most permutations power to a cycle of small prime length ⋮ Imprimitive irreducible modules for finite quasisimple groups ⋮ Generalised Sifting in Black-Box Groups ⋮ Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
This page was built for publication: Permutations with Restricted Cycle Structure and an Algorithmic Application