MATHEMATICS AND COMPUTERS
MATH 165, Fall Quarter, course information

Meetings: MWF 11:00pm-11:50am, PHYSICS/GEOLOGY 140.

Instructor: Jesús A. De Loera.

email: deloera@math.ucdavis.edu

http://www.math.ucdavis.edu/~deloera/TEACHING/MAT165/165.html

Phone: (530)-754 70 29

Office hours: Monday and Wednesday 12:00pm-12:50pm or by appointment. My office is 3228 MSB. The TA for this class is Mr. Eddie Kim his office hours are Tues/Thurs from 10:30-11:30 Tu/Th (MSB 2131). We will be glad to help you with any questions, concerns, or problems.

Prerequisites and expectations: This class is intended for Math and CS majors in their junior or senior year. It is necessary that you have a solid idea of how to write proofs and true familiarity with computer programming (say as in ECS 30). In particular you will have to learn MAPLE and COCOA. If in doubt please ask me about it.

You are expected to work outside the classroom programming, thinking about the theorems and exercises, etc. I estimate a minimum of 3 hours work at home per lecture. The most important thing is what YOU learn by doing. Math and CS are not spectator sports!

Text: The text for this course is ``Ideals, Varieties, and Algorithms'' by D. Cox, J. Little and D. O'shea Textbook, 2nd edition, Springer 2003.

There will be also an optional text An introduction to MAPLE, by A. Heck, Springer, 2006. Although I personally think it is enough to read MAPLE's help and follow the class examples to learn enough of the language.

Description and Goals: This course has two goals:

1) To introduce undergraduate students to algorithmic mathematics. This is the part of mathematics dedicated to actually finding solutions explicitly (no existencial proof). We focus on mathematical algorithms where the answer is to be computed exactly. This is complementary to the area of numerical analysis (MATH 128ABC) where answers are computed with limited precision and error.

2) It is now undeniable that computers are useful tools for finding counterexamples, discover patterns, and even proof theorems! For example, the proof of the four color theorem, investigation of fractals, etc. Thus the second goal of the course is to learn how computers are useful tools for mathematical research, experimentation and can even help to generate formal proofs. Please read Computers and the meaning of Proof this article from Scientific American (a bit old now)

Course outline: We will cover a wide range of topics:

(week 1) Motivation, Introduction to MAPLE, The algebra of polynomials, the remainder theorem and roots. GCD of polynomials and the Euclidean Algorithm.

(week 2) The fundamental theorem of algebra. Real and rational roots, Sturm sequences and Descartes's rule of signs.

(week 3) Ideals and Varieties.

(week 4) Term orders and Multivariate Division Algorithm.

FIRST MIDTERM

(week 5-6) Groebner bases and Buchberger's algorithm

(week 7-8) Applications: Solutions of systems of polynomial equations, Ideal membership problem, Implicitization, applications to engineering.

(week 9-10) Polynomial systems and Computer Generated proofs, Radical ideals and Hilbert's nullstellensatz.

SECOND MIDTERM

Grading policy: