48 . Fateme Akbari and Amir Hashemi
A Maple implementation of our algorithms to compute the saturation of zero-dimensional ideals.
47 . Fateme Akbari and Amir Hashemi
A Maple implementation of our algorithm to compute the saturation of binomial ideals.
46 . Amir Hashemi and Deepak Kapur
A Maple implementation of our algorithm to convert Grobner bases.
45 . Amir Hashemi and Benyamin M.-Alizadeh and Hossein Parnian and Werner M. Seiler
A Maple implementation of our algorithm to test whether a given sequence of homogeneous polynomials is regular or not.
44 . Amir Hashemi and H. Michael Moller
A Maple implementation of our algorithm for computing staggered linear bases.
43 . Amir Hashemi and Matthias Orth and Werner M. Seiler
A Maple implementation of our algorithm for computing relative involutive bases.
42 . Mahdi Dehghani Darmian and Amir Hashemi
A Maple implementation of our algorithms for computing (parametric) Grobner systems.
41 . Amir Hashemi and Martin Kreuzer and Samira Pourkhajouei
A Maple implementation of our algorithms for computing border bases using signature-based structures.
40 . Amir Hashemi and Mahsa Kazemi
A Maple implementation of our algorithms for computing with parametric standard bases.
39 . Nasibeh Aramideh and Amir Hashemi and Werner M. Seiler
A Maple implementation of our algorithm for computing X-regularity.
38 . Amir Hashemi and Hossein Parnian and Werner M. Seiler
A Maple implementation of our algorithm for computing a Janet decomposition for monomial ideals.
37 . Amir Hashemi and Masoumeh Javanbakht
A Maple implementation of our algorithm for computing staggered linear bases.
36 . Amir Hashemi and Hossein Parnian and Werner M. Seiler
A Maple implementation of our algorithm for computing a linear change to transform an ideal into Noether position.
35 . Amir Hashemi and Masoumeh Javanbakht
A Maple implementation of our algorithm for computing minimal H-bases.
34. Amir Hashemi and Mahdi Dehghani and Marzieh Barkhordar
A Maple-Sage implementation of our algorithm to compute universal Grobner bases for parametric ideals.
33 . Amir Hashemi and Bentolhoda Binaei and Werner M. Seiler
A Maple implementation of our algorithm to apply syzygy modules to compute Pommaret bases.
32 . Benyamin M.-Alizadeh and Amir Hashemi
A Maple implementation of our deterministic algorithm to transform an ideal into normal Position.
31 . Amir Hashemi and Masoumeh Javanbakht
A Maple implementation of our algorithm for computing minimal bases for syzygy modules.
30 . Amir Hashemi and Benyamin M.-Alizadeh and Mahdi Dehghani
The first file contains a Maple implementation of our algorithm for computing Grobner systems by a combination of GVW algorithm and Montes DisPGB algorithm. Also, it contains a Maple implementation of Kapur et al. algorithm. The second file is a Maple implementation of the classical montes DisPGB algorithm.
29. Amir Hashemi and Michael Schweinfurter and Werner M. Seiler
A Maple implementation of our algorithm to transform a given ideal into different kind of stable positions.
28. Amir Hashemi and Mahdi Dehghani and Marzieh Barkhordar
A Maple implementation of the parametric Grobner walk algorithm to convert Grobner systems.
27. Amir Hashemi and Delaram Talaashrafi
A Sage-Maple implementation of the algorithm to compute dynamic Grobner bases.
26. Amir Hashemi and Bentolhoda Binaei and Werner M. Seiler
A Maple implementation of the algorithms to compute involutive bases (Janet bases and Pommaret bases).
25. Amir Hashemi
A Maple implementation of some simple algorithms to compute Hilbert polynomial and Hilbert series of ideals using the theory of Pommaret bases.
24. Amir Hashemi and Mahdi Dehghani Darmian
A Maple implementation of some basic algorithms in parametric linear algebra and also that of parametric FGLM algorithm.
23. Amir Hashemi and Zahra Touraji
A Maple implementation of Rosenfeld-Grobner algorithm and its improvement.
22. Amir Hashemi
A Maple implementation of our new algorithm to put a given polynomial ideal into Nother position.
21. Amir Hashemi and Michael Schweinfurter and Werner M. Seiler
A Maple implementation of our new algorithm to compute absolute reduction number and big reduction number of a given polynomial ideal.
20 . Masoud Sabzevari and Amir Hashemi and Benyamin M.-Alizadeh and Joel Merker
A Maple implementation of our new algorithm to compute Lie algebras of infinitesimal CR-automorphisms of finite type. To use this library, please first unrar LieAlg.rar file and copy the files CRAut.lib and CRAut.ind into your libMaple directory. Then, close all opened Maple worksheets and open a new one. Finally, you can type with(CRAut); to see the functions of the library and open Example6.3.mw to run and follow Example 6.3 in the related paper.
19 . M. Behboodi, R. Beyranvand, A. Hashemi, H. Khabazian
A Maple implementation of our algorithm for computing all presentations of all finite rings of a given order.
18 . An anonymous referee
A Macaulay2 code for a correction of Example 3.4 in De Loera paper on Grobner bases and Graph colorings, 2012.
17 . Vladimir Gerdt and Amir Hashemi
A Maple implementation of our algorithm (preprint 2012) for computing minimal involutive systems for parametric ideals.
16 . Vladimir Gerdt and Amir Hashemi
A Maple implementation of Modified G2V algorithm (preprint 2012) for computing Grobner bases.
15 . Vladimir Gerdt and Amir Hashemi
A Maple implementation of G2V algorithm (see ISSAC 2010) for computing Grobner bases.
14 . Amir Hashemi and Benyamin M.-Alizadeh and Monire Riahi
A Maple implementation of invariant G2V algorithm for computing SAGBI Grobner bases.
13 . Amir Hashemi and Benyamin M.-Alizadeh and Monire Riahi
A Maple implementation of invariant F5 algorithm for computing SAGBI Grobner bases.
12 . Vladimir Gerdt and Amir Hashemi and Benyamin M.-Alizadeh
A Maple implementation of a variant of Gerdt algorithm (preprint 2011) for computing minimal involutive bases.
11 . Vladimir Gerdt and Amir Hashemi and Benyamin M.-Alizadeh
A Maple implementation of Gerdt algorithm (published in 2005) for computing minimal involutive bases.
10 . Amir Hashemi and Parisa Alvandi
A Maple implementation of our algorithm for computing Grobner bases over Galois rings by applying Buchberger's criteria.
9 . Amir Hashemi and Benyamin M.-Alizadeh and Mahdi Dehghani
A Maple implementation of our algorithm for computing Grobner systems by a combination of Faugere's F5 algorithm and Montes DisPGB algorithm.
8 . Amir Hashemi and Benyamin M.-Alizadeh
A Maple implementation of our algorithm for computing Grobner bases by combining Buchberger's criteria and IsRewritten criterion in Buchberger algorithm.
7 . Amir Hashemi and Mahdi Dehghani and Benyamin M.-Alizadeh
A Maple implementation of our algorithm (which is an improvement of Montes algorithm) for computing Grobner systems.
6 . Amir Hashemi and Benyamin M.-Alizadeh
A Maple implementation of our new algorithm for computing minimal polynomial of matrices over algebraic extension fields.
5 . Amir Hashemi and Benyamin M.-Alizadeh
A Maple implementation of Wang-Sun algorithm for factoring univariate polynomials over algebraic extension fields.
4 . Amir Hashemi and Benyamin M.-Alizadeh
A Maple implementation of our new algorithm for factoring univariate polynomials over algebraic extension fields.
3 . Amir Hashemi
A Singular library to check Noether position, Strong Noether position, Almost Borel poition and Borel position.
2 . Amir Hashemi
A Singular library to compute Noether normalization, Noether position test, satiety and Castelnuovo-Mumford regularity.
1 . Amir Hashemi, Gerhard Pfister and Hans Schonemann
A Singular library for computing Grobner bases by modular methods.
Distributed in Singular 3-0-3 , 2007.