3 citations · 11 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.RA2011★ 3 cited
A Variant of Gerdt's Algorithm for Computing Involutive Bases
Vladimir P. Gerdt, Amir Hashemi, Benyamin M. -Alizadeh
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifie…
math.AC2011★ 2 cited
A Groebner-bases algorithm for the computation of the cohomology of Lie (super) algebras
Benyamin M. -Alizadeh, Joel Merker, Masoud Sabzevari
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In orde…