|| Dr. Hoon Hong,
Office Hour: Tue 10:20-11:40, Thu 1:10-2:30
|| Fall 2019 Tue, Thu 11:45-1:00, POE 636
|| Learn fundamental mathematical theories and algorithms for tackling challenging problems in algebra.
- Computer algebra is a vast area. Hence it is impossible to cover all aspects within a semester, let alone in a year.
- Thus I have chosen three fundamental challenges (Counting, Solving, Eliminating). They are fundamental since numerous imporant and nontrivial problems in mathematics, science and engineering can be reduced to them.
- You will be learning major breakthrough theories and algorithms for tackling the challenges.
||(MA 407 or MA 521) and (MA 405 or MA 520)
|| Does not fulfill a General Education Program (GEP) category/co-reqisite
||No textbook will be required/used. The lectures will be self-contained
||We will be covering some of the materials from the following books. They are not required, since the lecture will be self-contained. They are listed here in case you want to study some related topics on your own. Most of them are freely available electronically from the library or web sites.
| Modern Computer Algebra
|| Cambridge Uni Press
|| Gathen, Gerhard
| Fundamental Problems of Algorithmic Algebra
|| Oxford Uni Press
| Ideals, Varieties and Algorithms
|| Cox, Little, O'Shea
| Using Algebraic Geometry by
|| Cox, Little, O'Shea
| Algorithms in Real Algebraic Geometry
|| Basu, Pollack, Roy
- One of the most effetive way to learn theories/algorithms is to carry out concrente computations
- There are numerous computer algebra software.
We will be using maple because it is eaiest to learn and most widely available on campus.
- For graduate students (working as RA or TA) can download your own copy from
- For other graduate students and undergraduate students, the software is available on almost all desk-top computers on campus. They are also available off campus via http:vcl.ncsu.edu. If you would like to buy one for yourself, it can be purchased at student price (roughly $99) at http:maplesoft.com
|| The letter grade will be determined from the total numeric grade as follows:
|Total Numeric Grade
The total numeric grade will be the sum of several numeric
grades as follows:
|Max Numeric grade
| Honor Pledge:
This is a tenative schedule. This might be updated depending on the progress and interest of the students.
||Descartes, Fourier, Sturm, Hermite, Hilbert
||Noether, Buchberger, Collins, Wu
||Sylvester, Macaulay, Tarski, Collins
||We are required to adhere to University Policy. You are strongly recommended to read the policy to learn about your rights and duties.