Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-28T04:01:29.937Z Has data issue: false hasContentIssue false
  • English
  • Français

The syzygies of m-full ideals

Published online by Cambridge University Press:  24 October 2008

Junzo Watanabe
Junzo Watanabe
Affiliation:
Hokkaido Tokai University, Department of Mathematics, Minami-ku, Sapporo 005, Japan
Get access Rights & Permissions [Opens in a new window]

Extract

The concept of an m-full ideal was introduced and studied first by D. Rees (unpublished). In 1983, after having considered and discussed the concept with Professor Rees, the author showed some properties of these ideals in [11], and other authors also have obtained results related to them (cf. [5, 7]). The purpose of this paper is to seek syzygies of m-full ideals and try to analyze their structure. Let a be an m-full ideal, and ᾱ the reduction by a general element. Then it is possible to determine the number of basic syzygies of a in terms of ᾱ. We show that this leads to a method for obtaining a set of basic syzygies of a provided that one for ᾱ is known (Theorem 6). Moreover the entire structure of the syzygy module is known when it is reduced by a general element. It turns out that a/za is the direct sum of ᾱ and copies of the residue field (Corollary 7).

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 109 , Issue 1 , January 1991 , pp. 7 - 13
Copyright
Copyright © Cambridge Philosophical Society 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Bayer, D. and Stillman, M.. A criterion for detecting m-regularity. Invent. Math. 87 (1987), 1–11.CrossRefGoogle Scholar
[2]Bayer, D. and Stillman, M.. A theorem on refining division orders by the reverse lexicographic order. Duke Math. J. 55 (1987), 321–328.CrossRefGoogle Scholar
[3]Buchberger, B.. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Math. 4 (1970), 374–383.CrossRefGoogle Scholar
[4]Buchberger, B.. Gröbner bases, An algorithmic method in polynomial ideal theory. In Recent Trends in Multi-Dimensional System Theory (editor Bose, N. K.), (Reidel, 1985). pp. 184–232.Google Scholar
[5]Choi, S.. Betti numbers and the integral closure of ideals. Ph.D. thesis, Purdue University (1989).CrossRefGoogle Scholar
[6]Galligo, A.. A propos du théorème de préparation de Weierstrass. In Fonctions de Plusieurs Variables Complexes, Lecture Notes in Math. vol. 409 (Springer-Verlag 1974). pp. 543–579.CrossRefGoogle Scholar
[7]Goto, S.. Integral closedness of complete-intersection ideals. J. Algebra 108 (1987), 151–160.CrossRefGoogle Scholar
[8]Mora, F. and Möller, H. M.. New constructive methods in classical ideal theory. J. Algebra 100 (1986), 138–178.Google Scholar
[9]Stanley, R.. Hilbert function of graded algebras. Adv. in Math. 28 (1978), 57–83.CrossRefGoogle Scholar
[10]Urabe, T.. On Hironaka's monoideal. Publ. Res. Inst. Math. Sci. 15 (1979), 279–287.CrossRefGoogle Scholar
[11]Watanabe, J.. m-full ideals. Nagoya Math. J. 106 (1987), 101–111.CrossRefGoogle Scholar