Comparisons for numbers of complete mappings

MaRDI QIDQ5150655zbMATH OpenFDO

Authors L. N. Bondarenko, M. L. Sharapova

Publication date 15 February 2021

Full work available at URL http://mathnet.ru/eng/pdm476

zbMATH Keywords

complete mappingsdisplacement of permutationEuler's numberspermutationstatisticWilson theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Congruences; primitive roots; residue systems (11A07)

Recommendations

• Upper bound on the number of complete maps
• The existence of strong complete mappings of finite groups: a survey
• Publication:4940372
• Calculation of the number of complete mappings for permutations
• On the hardness of counting problems of complete mappings.

Cites work

• A (Modest) Generalization of the Theorems of Wilson and Fermat
• scientific article; zbMATH DE number 3165639 (Why is no real title available?)
• scientific article; zbMATH DE number 3523762 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• On the hardness of counting problems of complete mappings.

Cited in

(3)

• Upper bound on the number of complete maps
• On the hardness of counting problems of complete mappings.
• Comparing the degrees of enumerability and the closed Medvedev degrees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Comparisons for numbers of complete mappings

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