Counting Semiregular Permutations which are Products of a Full Cycle and and an Involution

DOI10.2307/2001055zbMath0634.05008OpenAlexW4235796622MaRDI QIDQ3772227

David M. Jackson

Publication date: 1988

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

Full work available at URL: https://doi.org/10.2307/2001055

zbMATH Keywords

cycle decomposition of permutationsp-semiregular permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Ordinary representations and characters (20C15) Isotopy and pseudo-isotopy (57N37)

Related Items (2)

The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group ⋮ A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions

This page was built for publication: Counting Semiregular Permutations which are Products of a Full Cycle and and an Involution