Skip to main content

Constructive Membership Testing in Black-Box Classical Groups

  • Conference paper
  • 1627 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 6327)

Abstract

The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model (see [HCGT, Section 3.1.4]); that is, they do not require specific characteristics of the representations in which the input groups are given. The elements of a black-box group are represented, not necessarily uniquely, as bit strings of uniform length. We assume the existence of oracles to compute the product of two elements, the inverse of an element, and to test if two strings represent the same element. Solving the constructive membership problem for a black-box group G requires to write every element of G as a word in a given generating set. In practice we write the elements of G as straight-line programs (SLPs) which can be viewed as a compact way of writing words; see [HCGT, Section 3.1.3].

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Costi, E.: Constructive membership testing in classical groups. PhD thesis, Queen Mary, University of London (2009)

    Google Scholar 

  2. Holt, D.F., Eick, B., O’Brien, E.A.: The Handbook of Computational Group Theory. Chapman and Hall/CRC (2005)

    Google Scholar 

  3. Kantor, W.M., Seress, Á.: Black box classical groups. Memoirs Amer. Math. Soc., vol. 149 (2001)

    Google Scholar 

  4. Leedham-Green, C.R., O’Brien, E.A.: Constructive recognition of classical groups in odd characteristic. Journal of Algebra 322, 833–881 (2009)

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. O’Brien, E.A.: Algorithms for matrix groups. Groups St Andrews (Bath) (August 2009) (accepted to appear 2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambrose, S., Murray, S.H., Praeger, C.E., Schneider, C. (2010). Constructive Membership Testing in Black-Box Classical Groups. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15582-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15581-9

  • Online ISBN: 978-3-642-15582-6

  • eBook Packages: Computer ScienceComputer Science (R0)