A permutation (s0, s1,…, sN − 1) of symbols 0, 1,…, N − 1, is called good if the set (t0, t1,…, tN − 1) formed according to the rule ti = i + si (mod N), i = 0, 1, … N − 1, is also a permutation. A fast simulation method is proposed. It allows the number of good permutations to be evaluated with high accuracy for large N (in particular, N > 100). Empirical upper and lower bounds for the number of good permutations are presented and verified against numerical data.
permutation fast simulation method unbiased estimate sample variance relative error
This is a preview of subscription content, log in to check access.
V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).MATHGoogle Scholar
V. N. Sachkov, “Markov chains of iterative systems of transforms,” Tr. Discret. Mat., 6, 165–183 (2002).Google Scholar
C. Cooper, R. Gilchrist, I. N. Kovalenko, and D. Novakovic, “Estimation of the number of “good” permutations, with application to cryptography,” Cybern. Syst. Analysis, 35, No. 5, 688–693 (1999).MATHCrossRefMathSciNetGoogle Scholar
R. Konheim, Cryptography: A Primer, Wiley, Chichester (1991).Google Scholar
C. Cooper and I. N. Kovalenko, “An upper bound for the number of complete mappings,” Probability Theory and Math. Statistics, 53, 69–75 (1995).MATHGoogle Scholar