准-Groebner基的计算

本文通过定义S－多项式，给出了系数环是整环的多项式中理想的准－Groebner基的一个算法，并据此给出了计算该理想极大无关变元组和维数的一种方法。     

On the seidel integral complete multipartite graphs

For a simple undirected graph G, denote by A(G) the (0,1)-adjacency matrix of G. Let thematrix S(G) = J-I-2A(G) be its Seidel matrix, and let S _G (??) = det(??I-S(G)) be its Seidel characteristic polynomial, where I is an identity matrix and J is a square matrix all of whose entries are equal to 1. If all eigenvalues of S _G (??) are integral, then the graph G is called S-integral. In this paper, our main goal is to investigate the eigenvalues of S _G (??) for the complete multipartite graphs G = $G = K_{n_1 ,n_2 ,...n_t } $ . A necessary and sufficient condition for the complete tripartite graphs K _m,n,t and the complete multipartite graphs to be S-integral is given, respectively.     

Grobner基的一个应用

固定一个项序,利用Buchberger算法求多项式环S=C[x1,x2,…,xn]上的理想I的Grbner基.根据S上任意多项式f（x1,x2,…,xn）用Grobner基表示时其余项唯一的特点,将其应用到求解多项式方程组问题.实例展示用Grobner基可证明一个联立方程式是无解的.