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

DOI10.1007/s10559-008-9025-9zbMath1157.05304OpenAlexW1964710753MaRDI QIDQ1008305

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

sample variancerelative errorunbiased estimatemodified fast simulation methodgood permutation

Mathematics Subject Classification ID

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

Related Items (5)

A congruence connecting Latin rectangles and partial orthomorphisms ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ On the number of transversals in Cayley tables of cyclic groups ⋮ Compound orthomorphisms of the cyclic group ⋮ Estimating the number of Latin rectangles by the fast simulation method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applying fast simulation to find the number of good permutations
• Generalized complete mappings, neofields, sequenceable groups and block designs. II
• Upper bound on the number of complete maps
• On the hardness of counting problems of complete mappings.
• Estimation of the number of ``good permutations with applications to cryptography

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