# 一般子式理想之Grbner基底

No Thumbnail Available

2005

## Abstract

Let K be a field and R=K[X] be the polynomial algebra generated by the entries of a generic m×n matrix X=(x_ij) over K. Let p be a positive integer. Let G_p be the set of all p-minors of X and I be the ideal generated by G_p. Sturmfels and Caniglia et al. had proved that G_p is a Grbner basis for I with respect to some lexicographical term order of R. Later in 1992, Herzog and Trung improved their result. Also, in 1994 Conca obtained a similar result for a symmetric matrix. In this paper, we get some results similar to their results as follows. Theorem：Let X=(x_ij) be a generic m×n matrix over a field K, and let R=K[X]. Let m≧a_1≧…≧a_r , b_1≦…≦b_r≦n be nonnegative integers, and η_1,…,η_(r+1) be positive integers. Let D_t(X) be the part of the matrix X consisting of the last a_t rows and the first b_t columns. Let G_t(X) be the set of all (η_t)-minors of D_t(X), t=1,…,r and set D_(r+1)(X) be the set of all (η_(r+1))-minors of X. Let I be the ideal of R generated by the G(X)=∪G_t(X); then G(X) is a Grbner basis for I with respect to the lexicographic term order induced from the variable order x_11> x_12>…> x_1n> x_21>… > x_m1>… > x_mn. We also prove that if X=(x_ij) in the above theorem is an n×n symmetric matrix, then the theorem also holds.

## Keywords

Grbner基底, 子式, Grbner bases, minor