MATH 4370
Computational Algebra
Introduction to algebraic geometry and computational algebra. Students will learn how to compute a Gröbner basis for polynomials in many variables. Covers the following applications: solving systems of polynomial equations in many variables, solving diophantine equations in many variables, 3-colorable graphs, and integer programming. Such applications arise, for example, in computer science, engineering, economics, and physics. Students will be expected to be comfortable writing proofs. More experience with proofs may be gained by first taking a 3000-level MATH course.
fall 2026
Readings
- Cox, Little, and O'Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 4th edition , Springer-Verlag, 2015 (ISBN: 978-3-319-16720-6) — free e-book through the Cornell Math Library
- Lauritzen, Niels, Concrete Abstract Algebra: from numbers to Gröbner bases , Cambridge University Press, 2003 (ISBN: 978-0-521-53410-9) – free e-book through the Cornell Math Library
Prerequisites & course information
MATH 2210 or MATH 2230 or MATH 2310 or MATH 2940 or equivalent.