Estimating the number of good permutations by a modified fast simulation method

DOI10.1007/S10559-008-9025-9MaRDI QIDQ1008305zbMATH OpenOpenAlexFDO

Authors N. Yu. Kuznetsov

Publication date 27 March 2009

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

Full work available at URL https://doi.org/10.1007/s10559-008-9025-9

zbMATH Keywords

unbiased estimaterelative errormodified fast simulation methodsample variancegood permutation

Mathematics Subject Classification ID

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

Recommendations

• Applying fast simulation to find the number of good permutations
• Using the Monte Carlo method for fast simulation of the number of ``good permutations on the SCIT-4 multiprocessor computer complex
• Estimation of the number of ``good permutations with applications to cryptography
• Calculation of the number of complete mappings for permutations
• scientific article; zbMATH DE number 3557795

Cites work

• scientific article; zbMATH DE number 3930877 (Why is no real title available?)
• scientific article; zbMATH DE number 4023282 (Why is no real title available?)
• scientific article; zbMATH DE number 1409947 (Why is no real title available?)
• Applying fast simulation to find the number of good permutations
• Estimation of the number of ``good permutations with applications to cryptography
• Generalized complete mappings, neofields, sequenceable groups and block designs. II
• On the hardness of counting problems of complete mappings.
• Upper bound on the number of complete maps

Cited in

(9)

• Estimating the number of Latin rectangles by the fast simulation method
• On the number of transversals in Cayley tables of cyclic groups
• Additive triples of bijections, or the toroidal semiqueens problem
• Using the Monte Carlo method for fast simulation of the number of ``good permutations on the SCIT-4 multiprocessor computer complex
• Calculation of the number of complete mappings for permutations
• Estimation of the number of ``good permutations with applications to cryptography
• Applying fast simulation to find the number of good permutations
• Compound orthomorphisms of the cyclic group
• A congruence connecting Latin rectangles and partial orthomorphisms

This page was built for publication: Estimating the number of good permutations by a modified fast simulation method

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