Black box classical groups
by Kantor, W. M., (William M.)
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. The proof relies on the geometry of the classical groups rather than on difficult group-theoretic background. This algorithm has applications to matrix group questions and to nearly linear time algorithms for permutation groups. In particular, we upgrade all known nearly linear time Monte Carlo permutation group algori…
Read More ↓Title Statements
- Full title :Black box classical groups / William M. Kantor, Ákos Seress.
Summary
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. The proof relies on the geometry of the classical groups rather than on difficult group-theoretic background. This algorithm has applications to matrix group questions and to nearly linear time algorithms for permutation groups. In particular, we upgrade all known nearly linear time Monte Carlo permutation group algorithms to nearly linear Las Vegas algorithms when the input group has no composition factor isomorphic to an exceptional group of Lie type or a 3-dimensional unitary group.
Read More ↓Edition Statements
- Publication Date:©2001.
Publication Statements
- Publisher(s):American mathematical Society
- Place of Publication:Providence, R.I
- Language:eng
- Publication Date:©2001.
The Physical Object
- Description:1 online resource (viii, 168 pages)
Edition Identifiers
- ISBN:9781470402990, 1470402998
- oclc:ocn851088635
- LC Classification:QA3
- Dewey Decimal:510 s 512/.2
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Files & Downloads
-
Black Box Classical Groups -- (.djvu)
DJVU · 1.4 MB · updated
Rate & Review