【作者】 张圣贵；

【导师】 刘三阳；

【作者基本信息】 西安电子科技大学 ， 应用数学， 2003， 博士

【摘要】 B．Buchberger在域上的多项式环的单项式的集合中引入项序，并利用S-多项式，给出了一种算法，使得对多项式环中的任意给定的理想，从它的一组生成元，可计算得到一组被称为简化Gr(?)bner基的生成元，它具有“唯一性”的良好性质。所以利用Gr(?)bner基可以解决与理想相关的许多问题。此后，Gr(?)bner基的应用研究得到了迅速发展。Gr(?)bner基的应用研究包括代数方程组求解，多项式的因子分解，素理想的检验，代数流形的分解，纠错码中循环码和代数几何码的译码，密码学中高维线性递归阵列的分析与综合，多维系统理论，信号处理和求解整数规划等诸多领域。 Morita对偶理论起源于数域上的向量空间的对偶空间理论。许多代数学家均从事Morita对偶理论的研究。他们研究环扩张，Noether环，序列环，自同态环等的对偶性及自对偶。上个世纪九十年代，C．Menini和A．D．Rio在分次环中引入分次Morita对偶的概念，得到了与Morita对偶相类似的刻划。 本文研究了Gr(?)bner基理论在求矩阵极小多项式，判定矩阵可逆性和求逆矩阵等方面的应用，并讨论了多项式环的分次自对偶问题。具体内容如下： ·证明了域上的所有块循环矩阵组成的环同构于其上的多元多项式环的一个商环。因此，将求域上块循环矩阵的极小多项式转化为求一个环同态的核的简化Gr(?)bner基，从而给出了求块循环矩阵的极小多项式的算法。 ·给出了域上的块循环矩阵可逆性的充要条件及其逆矩阵的算法。 ·给出了四元素可除代数上的块循环矩阵可逆性的充要条件及其逆矩阵的两种算法。 ·给出了准确计算域上有限群的群代数上的多项式环的理想的Gr(?)bner基的算法。 ·定义了整代数线性规划，并给出了求解它的算法。 ·给出了求域上有限群的群代数上的块循环矩阵的极小多项式的算法，西安电子科技大学博士学位论文:多项式代数及其应用 奇异性判别法及其逆矩阵的求法.·给出了域上有限群的群代数上的块对称循环矩阵的奇异性判别法及其 逆矩阵求法.，定义了域上有限群的群代数上的混合块矩阵，并给出了它的可逆性的 判别法及其逆矩阵的求法.·定义了环的分次三角扩张和分次平凡扩张，并讨论了他们有分次Morita 对偶与其初始子环有Morita对偶之间的关系.·讨论了余生成子环上的多元多项式环作为不同群的分次环的分次自对 偶问题，并证明了有自对偶的环的一种特殊的分次三角扩张有分次自 对偶.更多还原

【Abstract】 B. Buchberger introduced the concepts of term orders in the set of all power products and presented an algorithm for finding a special generators, a reduced Grobner basis which is unique for a given term order, of a given ideal of a polynomial ring over a field from any generators of the ideal by means of S-polynomials. So many problems on ideals can be solved by the theory of the Grobner basis. Since 1980s, many mathematicians have been engaged in studying the applications of the Grobner basis such as solving the system of algebraic equations, factoring polynomials, testing primary ideals, factoring algebraic manifolds, decoding circular codes in corrected codes and algebraically geometrical codes, analyzing and synthesizing high dimensional linear recurring arrays in cryptology, dealing with multidimensional systematic theory, signaling, solving integer programming and so on.The theory of Morita duality comes from the theory of the dual space of a linear space, which was proposed by K. Morita and G. Azumaya in 1950s. Since then, the theory of Morita duality has become one of the important fields of Ring Theory and Module Theory. Many algebraists are engaged in studying this theory. They study the duality and selfduality of rings such as extensions of a ring with a Morita duality(or selfduality), Noether rings, series rings, endomorphism rings and so on. C. Menini and A. D. Rio introduced a graded Morita duality into Graded Ring Theory and obtained the similar characterizations of the Morita duality.The aim of this paper is to study the applications of Grobner bases in finding the minimal polynomial of a given matrix and its inverse if it is nonsingular and to discuss selfdualities over a polynomial ring. The main results are listed in the following: It is proved that the ring consisting of all block circulant matrices over a field is isomorphic to a factor ring of a polynomial ring in multivariables over the same field. So finding the minimal polynomial of a block circulant matrix is transformed into computing the reduced Grobner basis of a kernel of a ring homomorphism. Hence an algorithm for the minimal polynomial of a block circulant matrix over the field is presented. A sufficient and necessary condition for determining singularity of a block circulant matrix over a field is given, and an algorithm for the inverse of a nonsingular block circulant matrix over the field is presented. A sufficient and necessary condition for determining singularity of a block circulant matrix over a quaternion division algebra over a field is given, and twoalgorithms for the inverse of a nonsingular block circulant matrix over the quaternion division algebra are presented. An algorithm for Grobner basis for an ideal of a polynomial ring over a group algebra of a finite group over a field is given. An integral algebraic linear programming is defined and an algorithm for solving the programming is given. Algorithms for the minimal polynomial and the inverse of a given block circulant matrix over a group algebra of a finite group over a field are presented, and a method of determining singularity of this block circulant matrix is given. Algorithms for the minimal polynomial and the inverse of a given block symmetric circulant matrix over a group algebra of a finite group over a field are presented. and a method of determining singularity of this block symmetric circulant matrix is given. The definition of a mixed block matrix is given, and an algorithm for the inverse of a given mixed block matrix over a group algebra of a finite group over a field is presented, and a method of determining singularity of this mixed block matrix is given. Graded triangular extensions and graded trivial extensions over a ring are defined respectively, and the relation between them with grade Morita dualities and their initial subrings with Morita dualities is discussed. The graded selfduality of a polynomial ring in multivariables over a cogenerator ring as a graded ring of type different group i更多还原