Article
Licensed
Unlicensed
Requires Authentication
Constructive membership in black-box groups
-
P. E. Holmes
Published/Copyright:
September 30, 2008
Abstract
We present an algorithm to reduce the constructive membership problem for a black-box group G to three instances of the same problem for involution centralizers in G. If G is a finite simple group of Lie type in odd characteristic, then this reduction can be performed in (Monte Carlo) polynomial time.
Received: 2004-11-12
Revised: 2007-07-22
Published Online: 2008-09-30
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Constructive membership in black-box groups
- Connectivity of the product replacement algorithm graph of PSL(2, q)
- A method of Bender applied to groups of J3-type
- Determining a connected split reductive group from its irreducible representations
- A construction of almost all Brauer trees
- Irreducible components and isomorphisms of the Burnside ring
- On the single-orbit conjecture for uncoverings-by-bases
- On 2-generated subgroups and products of groups
- Covering number for reflections in trees
- A formula for the normal subgroup growth of Baumslag–Solitar groups
- Graphs, free groups and the Hanna Neumann conjecture
Articles in the same Issue
- Constructive membership in black-box groups
- Connectivity of the product replacement algorithm graph of PSL(2, q)
- A method of Bender applied to groups of J3-type
- Determining a connected split reductive group from its irreducible representations
- A construction of almost all Brauer trees
- Irreducible components and isomorphisms of the Burnside ring
- On the single-orbit conjecture for uncoverings-by-bases
- On 2-generated subgroups and products of groups
- Covering number for reflections in trees
- A formula for the normal subgroup growth of Baumslag–Solitar groups
- Graphs, free groups and the Hanna Neumann conjecture
