Algebraic structure → Group theory Group theory
Basic notions Subgroup Normal subgroup Quotient group (Semi-)direct product Group homomorphisms kernel image direct sum wreath product simple finite infinite continuous multiplicative additive cyclic abelian dihedral nilpotent solvable action Glossary of group theory List of group theory topics
Finite groups Cyclic group Zn Symmetric group Sn Alternating group An Dihedral group Dn Quaternion group Q Cauchy's theorem Lagrange's theorem Sylow theorems Hall's theorem p-group Elementary abelian group Frobenius group Schur multiplier Classification of finite simple groups cyclic alternating Lie type sporadic
Discrete groups Lattices Integers (${\displaystyle \mathbb {Z} }$) Free group Modular groups PSL(2, ${\displaystyle \mathbb {Z} }$) SL(2, ${\displaystyle \mathbb {Z} }$) Arithmetic group Lattice Hyperbolic group
Topological and Lie groups Solenoid Circle General linear GL(n) Special linear SL(n) Orthogonal O(n) Euclidean E(n) Special orthogonal SO(n) Unitary U(n) Special unitary SU(n) Symplectic Sp(n) G2 F4 E6 E7 E8 Lorentz Poincaré Conformal Diffeomorphism Loop Infinite dimensional Lie group O(∞) SU(∞) Sp(∞)
Algebraic groups Linear algebraic group Reductive group Abelian variety Elliptic curve

In computational group theory, a black box group (black-box group) is a group G whose elements are encoded by bit strings of length N, and group operations are performed by an oracle (the "black box"). These operations include:

• taking a product g·h of elements g and h,
• taking an inverse g⁻¹ of element g,
• deciding whether g = 1.

This class is defined to include both the permutation groups and the matrix groups. The upper bound on the order of G given by |G| ≤ 2^N shows that G is finite.

Applications

The black box groups were introduced by Babai and Szemerédi in 1984.^[1] They were used as a formalism for (constructive) group recognition and property testing. Notable algorithms include the Babai's algorithm for finding random group elements,^[2] the Product Replacement Algorithm,^[3] and testing group commutativity.^[4]

Many early algorithms in CGT, such as the Schreier–Sims algorithm, require a permutation representation of a group and thus are not black box. Many other algorithms require finding element orders. Since there are efficient ways of finding the order of an element in a permutation group or in a matrix group (a method for the latter is described by Celler and Leedham-Green in 1997), a common recourse is to assume that the black box group is equipped with a further oracle for determining element orders.^[5]

See also

• Implicit graph
• Matroid oracle

Notes

References

• Derek F. Holt, Bettina Eick, Eamonn A. O'Brien, Handbook of computational group theory, Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, Florida, 2005. ISBN 1-58488-372-3
• Ákos Seress, Permutation group algorithms, Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003. ISBN 0-521-66103-X.
• Kantor, William M.; Seress, Ákos (2001). Black Box Classical Groups. Memoirs of the American Mathematical Society. Vol. 708. American Mathematical Society. ISBN 978-0-8218-2619-5. ISSN 0065-9266.