Skip to main content
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1997: Rewriting Techniques and Applications pp 331–334Cite as

Opal: A system for computing noncommutative gröbner bases

Part of the Lecture Notes in Computer Science book series (LNCS,volume 1232)

Keywords

  • Free Algebra
  • Zero Divisor
  • Path Algebra
  • Artin Algebra
  • Free Associative Algebra

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-62950-5_83
  • Chapter length: 4 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   99.00
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Auslander, I. Reiten and S. O. Smalø. Representation Theory of Artin Algebras, Cambridge University Press, 1995.

    Google Scholar 

  2. I. Biehl, J. Buchmann and T. Papanikolaou. A Library for Computational Number Theory, Technical Report SFB 124-C1, Fabereich Informatik, Universität Saarlandes, 1995.

    Google Scholar 

  3. D. R. Farkas, C. D. Feustel and E. L. Green. “Synergy in the theories of Gröbner bases and path algebras”, Canadian Journal of Mathematics, 45, 4 (1993) 727–739.

    Google Scholar 

  4. B. Keller. “Alternatives in implementing noncommutative Gröbner basis systems”, Symbolic Rewriting Techniques, Birkhauser-Verlag, (to appear).

    Google Scholar 

  5. B. Keller. Algorithms and Orders for Finding Noncommutative Gröbner Bases, Dissertation, Virginia Polytechnic Institute & State University, (in preparation).

    Google Scholar 

  6. F. Mora. “Groebner bases for noncommutative polynomial rings,” in Algebraic Algorithms and Error-Correcting Codes, J. Calmet (ed.), LNCS# 229, Springer-Verlag, Berlin, 1986, 353–362.

    Google Scholar 

  7. D. Musser and A. Saini. STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library, Addison-Wesley, 1996.

    Google Scholar 

  8. T. Parr and R. Quong. “ANTLR: A predicated-LL(k) parser generator”, Software-Practice and Experience, 25, 4, (1995) 789–810.

    Google Scholar 

  9. B. Reinert. On Gröbner Bases in Monoid and Group Rings, Dissertation, FB Informatik, University of Kaiserslautern, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, VPI&SU, 24061-0106, Blacksburg, VA, USA

    Edward L. Green

  2. Department of Computer Science, VPI&SU, 24061-0106, Blacksburg, VA, USA

    Lenwood S. Heath

  3. Department of Computer Science, Montana Tech, 59701-8997, Butte, MT, USA

    Benjamin J. Keller

Authors
  1. Edward L. Green
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lenwood S. Heath
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Benjamin J. Keller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

    Rights and permissions

    Reprints and Permissions

    Copyright information

    © 1997 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Green, E.L., Heath, L.S., Keller, B.J. (1997). Opal: A system for computing noncommutative gröbner bases. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_83

    Download citation

    • DOI: https://doi.org/10.1007/3-540-62950-5_83

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-62950-4

    • Online ISBN: 978-3-540-69051-1

    • eBook Packages: Springer Book Archive