Towards a practical, theoretically sound algorithm for random generation in finite groups
| dc.creator | Cooperman, Gene | |
| dc.date | 2002-05-18 | |
| dc.date.accessioned | 2026-07-07T04:48:35Z | |
| dc.date.available | 2026-07-07T04:48:35Z | |
| dc.description | 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. | |
| dc.description | 29 pages, 6 figures, includes computational experiments | |
| dc.identifier | https://arxiv.org/abs/math/0205203 | |
| dc.identifier | http://arxiv.org/abs/math/0205203 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64102 | |
| dc.subject | Probability | |
| dc.subject | Group Theory | |
| dc.title | Towards a practical, theoretically sound algorithm for random generation in finite groups | |
| dc.type | text |