Permutations with Restricted Cycle Structure and an Algorithmic Application

DOI10.1017/S0963548302005217MaRDI QIDQ4796014zbMATHWikidataFDO

Authors Robert Beals, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress, C. R. Leedham-Green

Publication date 20 March 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

finite alternating groupfinite symmetric group with restricted cycle structure

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Recommendations

• On the frequency of permutations containing a long cycle.
• On permutations of order dividing a given integer
• Symmetric functions, generalized blocks, and permutations with restricted cycle structure
• Permutations without long or short cycles
• On the Erdős-Turán theorem on the logarithm of the order of a random permutation

Cited in

(21)

• The average number of cycles.
• Permutations with orders coprime to a given integer
• On the cardinality of a factor set in the symmetric group
• A recurrent algorithm for solving a combinatorial problem of arrangement with restrictions
• Generalised Sifting in Black-Box Groups
• On the number of \(p\)-regular elements in finite simple groups.
• scientific article; zbMATH DE number 177149 (Why is no real title available?)
• Pattern matching in the cycle structures of permutations
• Alternative developments of cyclic-permutation algorithms
• An algebraic approach for the search space of permutations with repetition
• On the maximum orders of elements of finite almost simple groups and primitive permutation groups.
• Finding involutions in finite Lie type groups of odd characteristic.
• On semiregular permutations of a finite set.
• Symmetric functions, generalized blocks, and permutations with restricted cycle structure
• On the frequency of permutations containing a long cycle.
• Proportions of elements with given 2-part order in finite classical groups of odd characteristic.
• Imprimitive irreducible modules for finite quasisimple groups
• Finding involutions with small support.
• Most permutations power to a cycle of small prime length
• Fast recognition of alternating groups of unknown degree.
• 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

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