首页 | 本学科首页   官方微博 | 高级检索  
     


Estimating the number of good permutations by a modified fast simulation method
Authors:N. Yu. Kuznetsov
Affiliation:(1) V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
Abstract:A permutation (s0, s1,…, sN − 1) of symbols 0, 1,…, N − 1 s 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 a permutation too. A modified fast simulation method is proposed to evaluate the number of good permutations for N = 205 with a 5% relative error. Empirical upper and lower bounds for the number of good permutations are also given. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 101–109, July–August 2008.
Keywords:good permutation  modified fast simulation method  unbiased estimate  sample variance  relative error
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号