On semiregular permutations of a finite set

DOI10.1090/S0025-5718-2011-02506-8zbMath1248.20003OpenAlexW1988782547WikidataQ56987643 ScholiaQ56987643MaRDI QIDQ3117227

Cheryl E. Praeger, Alice C. Niemeyer, Tomasz Popiel, Şükrü Yalçınkaya

Publication date: 17 February 2012

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02506-8

zbMATH Keywords

generating functionssymmetric groupsderangementsproportions of permutationssemiregular permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric groups (20B30) General theory for finite permutation groups (20B05) Probabilistic methods in group theory (20P05)

Related Items

Proportions of elements with given 2-part order in finite classical groups of odd characteristic. ⋮ FINDING INVOLUTIONS WITH SMALL SUPPORT ⋮ Fast recognition of alternating groups of unknown degree. ⋮ Permutations with orders coprime to a given integer

Cites Work

• Unnamed Item
• Unnamed Item
• All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
• Symmetric functions, generalized blocks, and permutations with restricted cycle structure
• On vertex symmetric digraphs
• Permutation groups, vertex-transitive digraphs and semiregular automorphisms
• Semiregular automorphisms of vertex-transitive cubic graphs
• Transitive Permutation Groups Without Semiregular Subgroups
• Semiregular automorphisms of cubic vertex transitive graphs
• Characterizing a family of elusive permutation groups
• QUASIPRIMITIVE GROUPS WITH NO FIXED POINT FREE ELEMENTS OF PRIME ORDER
• Permutations with Restricted Cycle Structure and an Algorithmic Application
• On some problems of a statistical group-theory. II
• Research problems