نتایج جستجو برای: Grobner bases

تعداد نتایج: 67104  

Journal: :bulletin of the iranian mathematical society 2012
amir hashemi mahdi dehghani darmian benyamin m.-alizadeh

the concept of comprehensive grobner bases was introduced by weispfenning. montes has proposed an efficient algorithm for computing these bases. but he has not explicitly used buchberger's criteria in his algorithm. in this paper we prove that we can apply these criteria on montes algorithm. we propose a modified version of montes algorithm and evaluate its performance via some examples.

Journal: :bulletin of the iranian mathematical society 0
amir hashemi isfahan university of technology mahdi dehghani darmian isfahan university of technology benyamin m.-alizadeh isfahan university of technology

the concept of comprehensive grobner bases was introduced by weispfenning. montes has proposed an efficient algorithm for computing these bases. but he has not explicitly used buchberger's criteria in his algorithm. in this paper we prove that we can apply these criteria on montes algorithm. we propose a modified version of montes algorithm and evaluate its performance via some examples.

Journal: :International Journal of Pure and Apllied Mathematics 2015

The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.

2003

Each matrix representation P: G —> GLn(K) of a finite Group G over a field K induces an action of G on the module A over the polynomial algebra A = K [ x 1 , . . . , xn]. The graded A-submodule M(P) of A generated by the orbit of (x1, ..., xn) is studied. A decomposition of MO) into generic modules is given. Relations between the numerical invariants of P and those of M(P), the latter being eff...

Journal: :International Mathematics Research Notices 2014

Journal: :Artificial Intelligence for Engineering Design, Analysis and Manufacturing 1997

Journal: :IEEE Trans. Information Theory 1995
Chris Heegard J. Little Keith Saints

Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Griihner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes. Index TermsSystematic encoding, algebraic-geometr...

Journal: :Journal of the Korean Mathematical Society 2008

Journal: :International Journal of Pure and Apllied Mathematics 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید