Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(online) ISSN 0002-9947(print)

 

Counting semiregular permutations which are products of a full cycle and an involution


Author: D. M. Jackson
Journal: Trans. Amer. Math. Soc. 305 (1988), 317-331
MSC: Primary 05A15; Secondary 05A05, 20C30
MathSciNet review: 920161
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Character theoretic methods and the group algebra of the symmetric group are used to derive properties of the number of permutations, with only $ p$-cycles, for an arbitrary but fixed $ p$, which are expressible as the product of a full cycle and a fixed point free involution. This problem has application to single face embeddings of $ p$-regular graphs on surfaces of given genus.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 05A15, 05A05, 20C30

Retrieve articles in all journals with MSC: 05A15, 05A05, 20C30


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9947-1988-0920161-4
PII: S 0002-9947(1988)0920161-4
Article copyright: © Copyright 1988 American Mathematical Society