Abstract
We give an algorithm for constructing a basis and a multiplication table of a finite-dimensional finitely-presented Liering. We apply this to construct the biggest t generator Lie rings that satisfy the n-Engel condition, for (t,n) = (t,2), (2,3), (3,3), (2,4).
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.
