Wyniki wyszukiwania:

The idea of the Grobner basis first appeared in a 1927 paper by F. S. Macaulay, who succeeded in creating a combinatorial characterization of the Hilbert functions of homogeneous ideals of the polynomial ring. Later, the modern definition of the Grobner basis was independently introduced by Heisuke Hironaka in 1964 and Bruno Buchberger in 1965. However, after the discovery of the notion of the Grobner basis by Hironaka and Buchberger, it was not actively pursued for 20 years. A breakthrough was made in the mid-1980s by David Bayer and Michael Stillman, who created the Macaulay computer...

The idea of the Grobner basis first appeared in a 1927 paper by F. S. Macaulay, who succeeded in creating a combinatorial characterization of the Hilbert functions of homogeneous ideals of the polynomial ring. Later, the modern definition of the Grobner basis was independently introduced by Heisuke Hironaka in 1964 and Bruno Buchberger in 1965. However, after the discovery of the notion of the Grobner basis by Hironaka and Buchberger, it was not actively pursued for 20 years. A breakthrough was made in the mid-1980s by David Bayer and Michael Stillman, who created the Macaulay computer...

This book demonstrates current trends in research on combinatorial and computational commutative algebra with a primary emphasis on topics related to monomial ideals.

Providing a useful and quick introduction to areas of research spanning these fields, Monomial Ideals is split into three parts. Part I offers a quick introduction to the modern theory of Grobner bases as well as the detailed study of generic initial ideals. Part II supplies Hilbert functions and resolutions and some of the combinatorics related to monomial ideals including the Kruskal--Katona theorem and algebraic...