Computation of Cohomology of Lie Algebra of Hamiltonian Vector Fields by Splitting Cochain Complex into Minimal Subcomplexes

Content Provider	Semantic Scholar
Author	Kornyak, Vladimir V.
Copyright Year	2002
Abstract	Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on partition of the full cochain complex into minimal subcomplexes. The algorithm was implemented as a C program LieCohomology. In this paper we present results of applying the program LieCohomology to the algebra of hamiltonian vector fields H(2|0). We demonstrate that the new approach is much more efficient comparing with the straightforward one. In particular, our computation reveals some new cohomological classes for the algebra H(2|0) (and also for the Poisson algebra Po(2|0)).
File Format	PDF HTM / HTML
Alternate Webpage(s)	https://arxiv.org/pdf/math/0205046v1.pdf
Alternate Webpage(s)	http://arxiv.org/pdf/math/0205046v1.pdf
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article