MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Two enumerative results on cycles of permutations

Author(s)
Stanley, Richard P.
Thumbnail
DownloadStanley_Two Enumerative.pdf (114.6Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution-Noncommercial-NoDerivatives http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
Abstract
Answering a question of Bona, it is shown that for n≥2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1,2,…,n} is 1/2 if n is odd and 1/2 - 2/(n-1)(n+2) if n is even. Another result concerns the polynomial P[subscript λ](q) = ∑[subscript w]q[superscript κ]((1,2,…,n)⋅w), where w ranges over all permutations in the symmetric group S[subscript n] of cycle type λ, (1,2,…,n) denotes the n-cycle 1→2→⋯→n→1, and κ(v) denotes the number of cycles of the permutation v. A formula is obtained for P[subscript λ](q) from which it is deduced that all zeros of P[subscript λ](q) have real part 0.
Date issued
2011-02
URI
http://hdl.handle.net/1721.1/98849
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
European Journal of Combinatorics
Publisher
Elsevier
Citation
Stanley, Richard P. “Two Enumerative Results on Cycles of Permutations.” European Journal of Combinatorics 32, no. 6 (August 2011): 937–943.
Version: Author's final manuscript
ISSN
01956698
1095-9971

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.