scientific article; zbMATH DE number 1409947

MaRDI QIDQ4940372zbMATHFDO

Authors

Publication date 2 March 2000

zbMATH Keywords

permutationcomplete mapping

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Recommendations

• Upper bound on the number of complete maps
• Compositions and parities of complete mappings and of orthomorphisms
• The existence of strong complete mappings of finite groups: a survey
• The existence of strong complete mappings
• Complete mappings in some linear and projective groups

Cited in

(15)

• On the maximum number of Latin transversals
• An asymptotic for the Hall-Paige conjecture
• On the number of transversals in Cayley tables of cyclic groups
• Estimating the number of Latin rectangles by the fast simulation method
• Applying fast simulation to find the number of good permutations
• Estimation of the number of ``good permutations with applications to cryptography
• Finite groups with an automorphism that is a complete mapping
• Comparisons for numbers of complete mappings
• A review of my scientific publications. Masters and coworkers
• Compound orthomorphisms of the cyclic group
• Calculation of the number of complete mappings for permutations
• Works of the Kiev school of theoretical cryptography
• Estimating the number of good permutations by a modified fast simulation method
• On the hardness of counting problems of complete mappings.
• On the number of closed extensive mappings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940372)