3 citations · 11 across the 5 of their papers we have counts for
6 papers
An Elimination Method to Solve Interval Polynomial Systems
Sajjad Rahmany, Abdolali Basiri, Benyamin M. -Alizadeh
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is…
Involutive Bases Algorithm Incorporating F5 Criterion
Vladimir P. Gerdt, Amir Hashemi, Benyamin M. -Alizadeh
Faugere's F5 algorithm is the fastest known algorithm to compute Groebner bases. It has a signature-based and an incremental structure that allow to apply the F5 criterion for dele…
Lie algebras of infinitesimal CR-automorphisms of finite type, holomorphically nondegenerate, weighted homogeneous CR-generic submanifolds of C^N
Masoud Sabzevari, Amir Hashemi, Benyamin M. -Alizadeh +1
We consider the significant class of holomorphically nondegenerate CR manifolds of finite type that are represented by some weighted homogeneous polynomials and we derive some usef…
Applications of differential algebra for computing Lie algebras of infinitesimal CR-automorphisms
Masoud Sabzevari, Amir Hashemi, Benyamin M. -Alizadeh +1
We perform detailed computations of Lie algebras of infinitesimal CR-automorphisms associated to three specific model real analytic CR-generic submanifolds in C^9 by employing diff…
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…
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…