Abstract
In this paper two versions of a new algorithm for computing cohomologies of Lie (super)algebras are described. The algorithm is based on splitting the full cochain complex into smaller subcomplexes. This approach makes the computation essentially more efficient since in most cases the dimensions of full cochain spaces included in the complexes are very high and these high-dimensional spaces can be divided into much smaller subspaces. Examples illustrating the work of the algorithm are given.
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.
