Fast constructive recognition of black box unitary groups ∗

@inproceedings{Brooksbank2004FastCR,
  title={Fast constructive recognition of black box unitary groups ∗},
  author={Peter A. Brooksbank},
  year={2004}
}
We present a new algorithm to recognise, constructively, when a given black box group is a homomorphic image of the unitary group SU(d, q) for known d and q. The algorithm runs in polynomial time assuming oracles for handling SL(2, q) subgroups and for computing discrete logarithms in cyclic groups of order q ± 1. 
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
12 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Cambridge Tracts in Mathematics 152

  • À. Seress, Permutation group algorithms
  • Cambridge U. Press
  • 2003
1 Excerpt

Seress, A black box algorithm for recognising finite symmetric and alternating groups, I

  • R. Beals, C. R. Leedham-Green, A. C. Niemeyer, Á.C.E. Praeger
  • Trans. Amer. Math, Soc
  • 2003

Constructive recognition of the finite simple classical groups, Ph

  • P. A. Brooksbank
  • D. thesis, U. Oregon,
  • 2001

Fast recognition of classical groups over large fields

  • M. Conder, C. R. Leedham-Green
  • pp. 113-121 in: Groups and Computation III (W. M…
  • 2001
1 Excerpt

The Computational Matrix Group Project

  • C. R. Leedham-Green
  • pp. 229-247 in: Groups and Computation III (W. M…
  • 2001
2 Excerpts

Similar Papers

Loading similar papers…