Skip to main content

Verification of non-identities in algebras

  • Arithmetic
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (ISSAC 1988)

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

Included in the following conference series:

Abstract

We present a computer assisted algorithm which establishes whether or not a proposed identity is a consequence of the defining identities of a variety of nonassociative algebras. When the nonassociative polynomial is not an identity, the algorithm produces a proof called a characteristic function. Like an ordinary counterexample, the characteristic function can be used to convince a verifier that the polynomial is not identically zero. However the characteristic function appears to be computationally easier to verify. Also, it reduces or eliminates problems with characteristic. We used this method to obtain and verify a new result in the theory of nonassociative algebras. Namely, in a free right alternative algebra (a,a,b)3≠0.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Clifton, A Simplification of the Computation of the Natural Representations of the Symmetric Group Sn, Proc. Amer. Math. Soc., 83(1981), 248–250.

    Google Scholar 

  2. L. Dornhoff, Group Representation Theory, Part A Ordinary Representation Theory, Marcel Dekker, Inc., 1971, New York.

    Google Scholar 

  3. I. R. Hentzel, L. Hogben, Exhaustive Checking of Sparse Algebras, Journal of Algorithms, 2(1981), 44–49.

    Google Scholar 

  4. I. R. Hentzel, L. Peresi, Counterexamples in Nonassociative Algebras, to appear in Algebras, Groups, and Geometries.

    Google Scholar 

  5. I. R. Hentzel, D. J. Pokrass, M. Slater, Discovering Short Proofs for Non-Identities, in preparation.

    Google Scholar 

  6. I. R. Hentzel, D. J. Pokrass, A Practical Solution for a Large Sparse Matrix, to appear in Software — Practice and Experience.

    Google Scholar 

  7. I. M. Miheev, One Identity in Right Alternative Rings, Algebra and Logic 8(1969), 204–211.

    Google Scholar 

  8. J. M. Osborn, Varieties of Algebras, Advances in Mathematics, 8(1972), 163–369.

    Google Scholar 

  9. M. Slater, Nucleus and Center in Alternative Rings, Journal of Algebra, 7(1967), 372–388.

    Google Scholar 

  10. R. K. Smith, Integral Representation of the Symmetric Group Sn, Master's Paper, Iowa State University, Ames, 1978.

    Google Scholar 

  11. K. A. Zhevlakov, A. M. Slin'ko, I. P. Shestakov, A. I. Shirshov, Rings That Are Nearly Associative, Academic Press, 1982, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hentzel, I.R., Pokrass, D.J. (1989). Verification of non-identities in algebras. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics