Abstract
One of the earliest sources of the composition method is Newman’s lemma [313] stated as follows. Let r be an oriented graph (i.e., a set of vertices and arrows, a -->bbetween them) which satisfies the
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Newman [313]
A. I. Shirshov [372], [377]
G. Bergman [51]
L. A. Bokut’ [70], [75], [78], [81] V. N. Latyshev [241]
B. Buchberger [104]
O. Kegel [185]
N. G. Nesterenko [310]
P. M. Cohn [114], [115], [111]
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bokut’, L.A., Kukin, G.P. (1994). Composition Method for Associative Algebras. In: Algorithmic and Combinatorial Algebra. Mathematics and Its Applications, vol 255. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2002-9_1
Download citation
DOI: https://doi.org/10.1007/978-94-011-2002-9_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4884-2
Online ISBN: 978-94-011-2002-9
eBook Packages: Springer Book Archive