MA-522 Computer Algebra
Fall 2021
Online on Zoom live or in Dabney 331, Tue&Thur 11:45am-1:00pm

Current Announcements

  • I will deliver the lectures live from home using the Zoom client https://ncsu.zoom.us (click Download client at bottom of page) on your device (cell phone, laptop, computer).
  • In addition, I will record the lectures and post links to the recordings on Moodle. Once you are logged in https://wolfware.ncsu.edu to see your courses, click on the orange "m" to go to the Moodle boiler plate. (Clicking on the title takes you to this page).
  • Individually, you can email me. Submission of your written assignments is by moodle. If you hand-write your homeworks, you can upload cell phone photos of your pages.
  • The lectures will start on August 17, 11:45am. I will email a Zoom ID to you at the beginning of the lecture, so that you can join the live meeting via this ID. I will also post the ID in the Moodle Lecture 1 title. The website https://ncsu.zoom.us/j/<ID> where <ID> is the ID may work.
  • My virtual office hours, to be held via Zoom, are listed on my schedule.
  • There are no examinations, and the homeworks, end-of-semester presentation, term paper or Maple project substituting for term paper are the sole parameter used to determine the course grade.
  • The course web sites for Fall 2018, Fall 2016, Fall 2012, Fall 2009.
Old Announcements see below.

Peoples' home pages: Erich Kaltofen,

Maple programs for the course.

Homeworks

Projects

Computer Help Resources

Syllabus

Course Outline*

Lecture Topic(s) Notes Book(s)
1. Aug 17 Administrative meeting. Algorithm Defined. Undecidability of the Halting Problem.

Robert McNaughton, Elementary Computability, Formal Languages, and Automata, Section 1.1.
2. Aug 19 First algorithms: Karatsuba's Algorithm; big-Oh notation

GG §4.3, GG §20
3. Aug 24 Algebraic Random Access Machine (RAM) model of computation; analysis of Karatsuba's Algorithm; bit complexity
Ka88_jacm.pdf, Section 2.
GG §4.3, GG §20
4. Aug 26 Repeated squaring, RSA
3.mws,
GG §2; §3; §5.4
5. Aug 31 Extended Euclidean algorithm; Hermite elimination
hermite.mws, lagrange.mws
GG §3.3; §4.5; §5.2
6. Sep 2 Analysis of Euclid; Chinese remaindering
chrem.mws

Mon, Sep 6 Labor Day, no class
7. Sep 7 Newton and Lagrange interpolation; Reed-Solomon code and decoding
ISSAC 21 talk, welch_berlekamp.mws
GG §5.10, §5.11
8. Sep 9 Distribution of primes; use of interpolation/CRA; rational number recovery; continued fraction approximations of a rational number
[Kaltofen and Villard 2004, p. 112] , [Kaltofen and Rolletschek 1989, Theorem 5.1], KR_ratrec.mpl, KR_ratrec.mws, cont_frac.pdf, cont_frac.mws

9. Sep 14 Reed-Solomon decoding by rational function recovery
BW_rat_fun.mws, notes.pdf
GG §5.8
10. Sep 16 Pollard rho; birthday paradox
Pollard rho code: new_pollard_rho.mpl, new_pollard_rho.mws, new_pollard_rho.pdf
GG §19.4
11. Sep 21 Primitive elements modulo p; computing discrete logs via Shanks's baby-steps/giant steps method and Pollard rho
Teske's paper; discrete log Pollard rho code: new_discrete_log.mpl

12. Sep 23 Diffie/Hellman/Merkle key exchange; el Gamal crypto system

GG §20.3, 20.4
13. Sep 28


14. Sep 30


Mon-Tue, Oct 4-5 Fall Break, no class
15. Oct 7 Definition of intergral domain, field of quotients; Euclidean algorithm for polynomials over a field; Sylvester resultants
sylvester.mws, sylvester.txt.
GG §25.2, §25.3 and §6.3
16. Oct 12 Fraction-free Gaussian elimination


Wed, Oct 13, 23h59 Last day to drop the course
17. Oct 14 Fundamental theorem on subresultants

GG §6.10 and §11.2
18. Oct 19 Unique factorization domains


19. Oct 21 Algebraic extension fields; construction of a splitting field.


20. Oct 26 Isomorphism of splitting fields; Galois group; separable and inseparable extensions


21. Oct 28 Norms and traces; the fundamental theorem on symmetric functions; the ring of algebraic integers

tower_of_fields.mws, tower_of_fields.txt.
22. Nov 2 Cyclotomic extensions; the infrastructure of finite fields


23. Nov 4 Factoring polynomials over finite fields: the Berlekamp polynomial factoring algorithm; Camion's large primes method

GG §14
Fri, Nov 5 Topic for class presentation must be declared at 17h
24. Nov 9 Factoring polynomials over finite fields cont.: the distinct degree and Cantor-Zassenhaus algorithm
factmodp.mws
GG §14.8
Wed Nov 10 Approvals of topics for term papers by me are posted
25. Nov 11 Polynomial ideals; term orders; reduction


26. Nov 16 Gröbner bases; Buchberger's algorithm

GG §21
27. Nov 18 Buchberger's algorithm continued
groebner.mws

28. Nov 23 Critical pair/completion paradigm: GCD-free basis construction
[Kaltofen 85, Section 3]

Wednesday-Friday, Nov 24-26 🦃 Thanksgiving, no class
Thur., Dec 2, noon-3:30pm Presentations
Friday, December 10, 11:59am Fall grades due
* This is a previous list and may be re-arrangend; new topics and replace listed ones by request.

Textbook and Notes

I will be closely following whose sections are marked in the above syllabus by GG.

On-line information: All information on courses that I teach (except individual grades) is now accessible via html browsers, which includes this syllabus. Click on my courses' page of my resume. You can also find information on courses that I have taught in the past.

Grading and General Information

Grading will be done with plus/minus refinement.

There will be six homework assignments of approximately equal weight and a choice of a Maple programming project or a term paper. At the end of the course, each student will give a 30 minute presentation on material from the book not covered by me. A choice of topics will be provided by me. Class attendance will not be monitored in any way. If you need assistance in any way, please let me know (see also the University's policy).

Academic Standards

Late submissions: All homeworks and projects must be submitted on time. The following penalties are given for (unexcused) late submissions:

If you need assistance in any way, please let me know (see also the University's policy).


Old Announcements


©2009, 2012, 2016, 2018, 2021 Erich Kaltofen. Permission to use provided that copyright notice is not removed.