Permutation Group Algorithms via Black Box
نویسنده
چکیده
If a black box simple group is known to be isomorphic to a classical group over a field of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. This is used to upgrade all nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the input group has no composition factor isomorphic to an exceptional group of Lie type or a 3-dimensional
منابع مشابه
Permutation group algorithms via black box recognition algorithms
If a black box simple group is known to be isomorphic to a classical group over a eld of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. This is used to upgrade all nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the input group has no composition factor isomorphic to an exceptional group of Lie type or a 3{dimensi...
متن کاملTowards a Practical, Theoretically Sound Algorithm for Random Generation in Finite Groups
This work presents a new, simple O(log |G|) algorithm, the Fibonacci cube algorithm, for producing random group elements in black box groups. After the initial O(log |G|) group operations, ε-uniform random elements are produced using O((log 1/ε) log |G|) operations each. This is the first major advance over the ten year old result of Babai [Bab91], which had required O(log |G|) group operations...
متن کاملBlack Box Exceptional Groups of Lie Type
If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank > 1, other than any F4(q), over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism. In view of its timing, this algorithm yields an upgrade of all known nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the in...
متن کاملSmall Base Groups, Large Base Groups and the Case of Giants
Let G be a finite permutation group acting on a set Γ. A base for G is a finite sequence of elements of Γ whose pointwise stabiliser in G is trivial. Most (families of) finite permutation groups admit a base that grows very slowly as the degree of the group increases. Such groups are known as small base and very efficient algorithms exist for dealing with them. However, some families of permuta...
متن کاملQuantum vs. deterministic queries on permutations
K.Iwama and R.Freivalds [12] considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of n-permutations where n is an odd number is difficult. There was no example of permutation problem where quantization can save half of the queries for (2m + 1)-permu...
متن کامل