Permutations

Louis Comtet
Additional contact information
Louis Comtet: University of Paris-Sud

Chapter Chapter VI in Advanced Combinatorics, 1974, pp 230-267 from Springer

Abstract: Abstract We recall that a permutation σ of a finite set N, |N| = n, is a bijection of N onto itself.

Keywords: Recurrence Relation; Stirling Number; Eulerian Polynomial; Cycle Indicator; Advance COMBINATORICS (search for similar items in EconPapers)
Date: 1974
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-010-2196-8_6

Ordering information: This item can be ordered from
http://www.springer.com/9789401021968

DOI: 10.1007/978-94-010-2196-8_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().