Abstract
We are interested in deciding if a given nonassociative polynomial h is an identity for a variety of nonassociative algebras. We present an algorithm for constructing a certain homomorphic image of a free nonassociative algebra which is sufficient to answer the question. The algorithm resembles dynamic programming in that the algebra is built by constructing a sequence of subspaces; the basis of each subspace is determined by the basis of previous subspaces. The number of arithmetic operations required to construct the algebra is bounded by a polynomial in the degree of h and the dimension of the resulting algebra.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
