Calculation of the number of complete mappings for permutations

DOI10.1007/BF02678671zbMath0965.05015MaRDI QIDQ1592100

D. Novakovich

Publication date: 15 January 2001

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

algorithmsenumerationpermutation

Mathematics Subject Classification ID

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

Related Items (2)

A congruence connecting Latin rectangles and partial orthomorphisms ⋮ Compound orthomorphisms of the cyclic group

Cites Work

• Upper bound on the number of complete maps
• Estimation of the number of ``good permutations with applications to cryptography
• On estimation of the probability of absence of collisions of some random mappings
• Unnamed Item

This page was built for publication: Calculation of the number of complete mappings for permutations