Upper bound on the number of complete maps

DOI10.1007/BF02366583zbMath0877.05003OpenAlexW1968076764MaRDI QIDQ1364111

Igor N. Kovalenko

Publication date: 8 December 1997

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

Full work available at URL: https://doi.org/10.1007/bf02366583

zbMATH Keywords

permutationsrandom permutationenumeration algorithmnumber of complete maps

Mathematics Subject Classification ID

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

Related Items (11)

On the maximum number of Latin transversals ⋮ The number of transversals in a Latin square ⋮ A review of my scientific publications. Masters and coworkers ⋮ Works of the Kiev school of theoretical cryptography ⋮ Applying fast simulation to find the number of good permutations ⋮ On the number of transversals in Cayley tables of cyclic groups ⋮ Compound orthomorphisms of the cyclic group ⋮ A survey of known results and research areas for \(n\)-queens ⋮ Estimating the number of good permutations by a modified fast simulation method ⋮ Estimating the number of Latin rectangles by the fast simulation method ⋮ Calculation of the number of complete mappings for permutations

This page was built for publication: Upper bound on the number of complete maps