有限群中随机生成的一个实用的、理论上合理的算法
Towards a practical, theoretically sound algorithm for random generation in finite groups
摘要:
本文提出了一种新的、简单的O(log^2 |G|)算法,即Fibonacci立方体算法,用于在黑盒群中产生随机群元素。在初始的O(log^2 |G|)群运算之后,ε-均匀随机元分别使用O((log 1/n)log |G|)运算产生。这是Babai [Babai 91]十年前的结果的第一个重大进步,Babai [Babai 91]需要O(log^5 |G|)群运算。初步的实验结果表明,斐波那契立方体算法是具有竞争力的产品替换算法。新的结果导致了置换群算法的一个有趣的逆转。在过去,置换群的最快随机生成是作为置换群成员算法的应用而实现的,并且使用关于置换表示的深入知识。新的黑盒随机生成算法对于置换群也是有效的,同时不使用特定于置换表示的知识。作为一个应用,我们证明了一个新的算法的置换群成员,是渐近快于所有以前已知的算法。
英文摘要:
This work presents a new, simple O(log^2|G|) algorithm, the Fibonacci cube algorithm, for producing random group elements in black box groups. After the initial O(log^2|G|) group operations, epsilon-uniform random elements are produced using O((log 1/epsilon)log|G|) operations each. This is the first major advance over the ten year old result of Babai [Babai91], which had required O(log^5|G|) group operations. Preliminary experimental results show the Fibonacci cube algorithm to be competitive with the product replacement algorithm. The new result leads to an amusing reversal of the state of affairs for permutation group algorithms. In the past, the fastest random generation for permutation groups was achieved as an application of permutation group membership algorithms and used deep knowledge about permutation representations. The new black box random generation algorithm is also valid for permutation groups, while using no knowledge that is specific to permutation representations. As an application, we demonstrate a new algorithm for permutation group membership that is asymptotically faster than all previously known algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。