Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the number of permutations on \(n\) objects with greatest cycle length \(k\)

From MaRDI portal
Publication:1383436
Jump to:navigation, search

DOI10.1006/aama.1997.0567zbMath0897.05005OpenAlexW1514828253MaRDI QIDQ1383436

Peter Gaal, Solomon W. Golomb

Publication date: 20 April 1998

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1997.0567


zbMATH Keywords

cycleenumerationnumber of permutations


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)


Related Items (2)

Increasing Hamiltonian paths in random edge orderings ⋮ Factorization patterns on nonlinear families of univariate polynomials over a finite field




Cites Work

  • Unnamed Item
  • Unnamed Item




This page was built for publication: On the number of permutations on \(n\) objects with greatest cycle length \(k\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1383436&oldid=13529873"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki