Titlebook: Computations in Algebraic Geometry with Macaulay 2; David Eisenbud,Michael Stillman,Bernd Sturmfels Textbook 2002 Springer-Verlag Berlin H

Addendum

書目名稱Computations in Algebraic Geometry with Macaulay 2影響因子(影響力)




書目名稱Computations in Algebraic Geometry with Macaulay 2影響因子(影響力)學(xué)科排名




書目名稱Computations in Algebraic Geometry with Macaulay 2網(wǎng)絡(luò)公開度




書目名稱Computations in Algebraic Geometry with Macaulay 2網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computations in Algebraic Geometry with Macaulay 2被引頻次




書目名稱Computations in Algebraic Geometry with Macaulay 2被引頻次學(xué)科排名




書目名稱Computations in Algebraic Geometry with Macaulay 2年度引用




書目名稱Computations in Algebraic Geometry with Macaulay 2年度引用學(xué)科排名




書目名稱Computations in Algebraic Geometry with Macaulay 2讀者反饋




書目名稱Computations in Algebraic Geometry with Macaulay 2讀者反饋學(xué)科排名

茁壯成長

額外的事

寬容

Needles in a Haystack: Special Varieties via Small Fields we develop a program that produces random curves of genus . ≤ 14. In the second part we use the program to test Green’s Conjecture on syzygies of canonical curves and compare it with the corresponding statement for Coble self-dual sets of points. In the third section we apply our techniques to prod

construct

Substance-Abuse

1431-1550 , commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations978-3-642-07592-6978-3-662-04851-1Series ISSN 1431-1550

Substance-Abuse

Computations in Algebraic Geometry with Macaulay 2

舊石器時代

1431-1550 ry material: Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re- cently developed algorithms have made theoretical aspect

Communicate

https://doi.org/10.1057/9780230509559d polynomial ring, so they can be represented in the computer, and can be used to compute Ext modules simultaneously in all homological degrees. It is shown how to write . code to implement the construction, and how to use the computer to determine invariants of modules over complete intersections that are difficult to obtain otherwise.

禍害隱伏

Richard Sutton,David G. Bendittnected. In this chapter we illustrate the use of . for exploring the structure of toric Hilbert schemes. In the process we will encounter algorithms from commutative algebra, algebraic geometry, polyhedral theory and geometric combinatorics.