• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Gröbner Bases: Statistics and Software Systems

Gröbner Bases: Statistics and Software Systems

Hardcover

ApplicationsProbability & Statistics

ISBN10: 4431545735
ISBN13: 9784431545736
Publisher: Springer Nature
Published: Jan 17 2014
Pages: 474
Weight: 1.90
Height: 1.06 Width: 6.14 Depth: 9.21
Language: English

The idea of the Gröbner 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 Gröbner basis was independently introduced by Heisuke Hironaka in 1964 and Bruno Buchberger in 1965. However, after the discovery of the notion of the Gröbner 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 algebra system with the help of the Gröbner basis. Since then, rapid development on the Gröbner basis has been achieved by many researchers, including Bernd Sturmfels.

1 different editions

Also available

Also in

Probability & Statistics