Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computation of Cohomology of Lie Algebra of Hamiltonian Vector Fields by
  Splitting Cochain Complex into Minimal Subcomplexes   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)).

33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
1
The categories of this paper are: cs
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an