Mathematics – Numerical Analysis
Scientific paper
2002-05-06
Mathematics
Numerical Analysis
8 pages, submitted to CASC-2002
Scientific paper
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)).
No associations
LandOfFree
Computation of Cohomology of Lie Algebra of Hamiltonian Vector Fields by Splitting Cochain Complex into Minimal Subcomplexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computation of Cohomology of Lie Algebra of Hamiltonian Vector Fields by Splitting Cochain Complex into Minimal Subcomplexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of Cohomology of Lie Algebra of Hamiltonian Vector Fields by Splitting Cochain Complex into Minimal Subcomplexes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-497289