## Math 187/187A: Introduction to Cryptography (Winter 2017)

**This course used to be called MATH 187. It has the same content as MATH 187 from previous years, but it is in the process of changing its catalog number. It is still 187 on blink.**

**Lecture**: MWF 11-11:50am in Ledden Auditorium

**Instructor**: Alina Bucur

Office: AP&M 7151

Email: [email protected]

Office hours: Th 3-4pm (if you cannot make either of these times, please email me for an appointment).

**Discussion sections**: Everyone is expected to attend the section they are registered for. Only students registered in that section will be allowed in the discussion classroom. Please check blink for your discussion time.

TAs: | Quang Bach | Geoffrey Ganzberger | Marc Loschen | Kyle Meyer |

A05, A06 | A03, A04 | A02 | A01 | |

[email protected] | [email protected] | [email protected] | [email protected] | |

OH | W 5:30-7:30pm | W 2:30-4:30pm | Th 10am-12pm | M 1-2pm |

Teaching and Learning Commons Geisel 1st floor | Muir Woods Coffee Shop | APM 5412 | APM 6446 |

**Required text**: none. Notes will be provided as handouts in class and/or online. For those really interested, a good reference is An introduction to mathematical cryptography by Hoffstein, Pipher and Silverman. (The link provides electronic access through UCSD library.)

**Handouts**: You will need a username and password to access this part of the website. The credentials are posted in TritonEd.

**SageMathCloud**: SageMathCloud is a web service running the Sage open-source computer algebra system, but it can be accessed using any web browser and so requires no special software installation. Sage in turn is based on the Python programming language, but no prior knowledge of the Python language will be assumed.

All students are **required** to create an account on SageMathCloud using their ** @ucsd.edu email address** in order to complete and submit assignments. There is no cost for a basic account, so you can try out the software for free. Students registered in the class will get a free upgrade to full functionality.

Note that the web interface is not currently optimized for small screens like smartphones; you might be able to manage with a large tablet and keyboard, but I can't guarantee that this will work. I also recommend bringing a suitable device to lecture/discussion so that you can try things out as we demonstrate them! I will post a note under *Announcements* a few days before the lectures when we will use SMC to alert you that you should bring a suitable device to class. * Misuse of SMC, including abusive or intolerant behavior, will be subject to campus disciplinary measures.*

**Quizzes**: There will be 6-8 quizzes administered Fridays during lecture. Sample quizzes will be posted on Friday the previous week.

**Homework**: There will be a 3-4 computer assignments: 1 computer assignment on codebreaking using the applets; 2-3 computer assignments using SageMathCloud.

Each computer assignment counts as one quiz.

**Final exam**: Monday, March 20, 11:30-2:30pm, Ledden Auditorium. *Please note that by signing up for this course, you are agreeing to sit for the final examination at this date and time.* The exam is not cumulative and it counts as 3 quizzes. This grade cannot be dropped. **Please bring a blue book to the final.**

**Grading**: All grades are recorded on TritonED. **Only grades that appear in TritonED will be included in calculating the total score for the course.**

The final will be worth as much as 3 quizzes. The computer assignment counts as 1 quiz. **It is your responsibility to make sure your grades are recorded in TritonED. **If you do not have access to TritonED, make sure you get it by Friday Jan 20. **All tests will be open books and open notes.** You will not need a computer for the any of the tests, but a calculator might be useful for some of the tests. If you do use a computer, you can **only** access the class website or SageMathCloud. No messaging, no search engines, no websites other than the two explicitly allowed, no communication of any sort with any other people, be they friends or enemies.**The lowest quiz score will be dropped.** If you miss one quiz, your score will be 0 on it and that will automatically become your lowest quiz score and be dropped. The final exam grade will not be dropped under any circumstances.

No make-up exams and no make-up quizzes will be given. Cheating on an exam/quiz or any infringement of academic integrity results in **failing the class**, as well as further disciplinary action. Please read very carefully the following ACADEMIC INTEGRITY GUIDELINES.

**Grade Recording Errors:** Keep all of your returned quizzes and homeworks. If there is any mistake in the recording of your scores, you will need the original assignment/quiz in order for us to make a change. The error has to be reported *within 1 week* since it occurred. No error reports will be accepted after week #9 of the term.

**Regrade Policy:** All graded material (except the final) will be returned in discussion sections. If you believe there might be an error in the grading and wish to have your quiz/homework regraded, you must observe the following rules.

- Return your test immediately to your TA. Regrade requests will not be considered once the test leaves the room.
- If you disagree with the TA's answer to your regrade request, you may ask for the instructor to review it. In order to do this, you must:
- return your test immediately to your TA and
- ask that they forward it to the instructor.

- Instructor review requests will not be considered once the test leaves the room.

- If you disagree with the TA's answer to your regrade request, you may ask for the instructor to review it. In order to do this, you must:
- Retrieve your test during discussion section or arrange to pick it up from your TA within one week after it was made available for pickup (i.e., returned) in section. In order to be considered, regrade requests must be submitted within one week after being returned in section.

**Letters of recommendation:** In general, you should try to get a letter of recommendation from a professor with whom you had some one-to-one contact. I will consider recommendation requests only from people who have placed in the top 25% of the class (in the past, this meant a grade of A+) and who have had some nontrivial interaction with me outside lecture.

**Communication:** I am happy to talk/answer questions right after class or during office hours. If you cannot make the office hours posted, email me to make an appointment. As a general rule, I will not respond to email unless it is a request to set up an appointment. If you email me with a general question, the answer might be an update to the website for the benefit of the next person with the same question!

**Announcements**:

- The class is at full capacity and has a long wait list. Therefore I will not sign any permission slips.
- All discussions sections will run as usual on Monday January 9. You will go through the sample quiz posted under "Handouts".
- There are no office hours on Th 01/12.
- On Friday 01/13, instead of a regular lecture we will have a help session for SageMathCloud (SMC) and Q&A session with the TAs going over the sample quiz problems. Please bring a laptop or similar in order to access SMC.
- I will have extended office hours 3-4:30pm on Th 01/19.
- We will use SMC in lecture on Monday 01/30. Please bring a laptop or appropriate device to class. You should double check
**before lecture**that you can see the handout (called*Caesar shifts*) that was pushed yesterday. - We will use SMC again on Wednesday 02/01. Please bring a laptop or appropriate device to class.
- There will be no quiz on Friday 02/10. Instead of quiz, we have the first computer assignment.
- The first computer assignment is now in SMC. It is called
*hw1*and it can be found in your private MATH 187/187A project (where you found the handouts on Caesar shifts),**not**the shared project. - HW1 has been updated at 10:30pm on Friday 02/03. Please work in the updated file.
- HW1 Problem 3 correction: it should say "use the function you wrote in Problem
**2**" insted of "problem 1". - Starting with Quiz 4 (on Friday 02/17) you will be responsible for bringing your own paper, including scratch paper.
- Earlier today you have received an email (sent through TritonED) about HW2. The email contains a personalized link, username and password. The assignments are due on F 2/24 in lecture. Please read the instructions carefully, mark clearly your name, PID and group number on your solutions. Each student must do the problems assigned to their group. No credit will be given for solutions to a different assignment.
- There will be no quiz on F 2/24.
- See updated office hours.
- HW2 is
**not**in SMC. Please follow the link in the email I sent you on 2/17/2017 with the subject line*MATH 187 - Bucur [WI17]: MATH 187 HW2 - corrected link*. - The last quiz (Quiz 6) will be
**Monday, 13 March 2017**in lecture (11:00-11:50am, Ledden). - A practice final will be posted during the last week of classes.
- On Thursday 3/9, I will hold office hours 1-2pm instead of the usual time slot.
- I will have special office hours before the final on Thursday 3/16 3-4pm as usual (but no office hours W 3/15) and
**Sunday**3/19 3-5pm. - Quang Bach will lead a review for the final on Friday 3/17, 7-9pm in Center Hall 119.
- If you need a leftie desk for the final, email me with the subject line
*MATH 187 final exam seat request*. - For the final, all computations have to be done "by hand". That is you can use a calculator (or SMC at the level of a calculator) to do squaring/multiplication of two numbers followed by reduction modulo
*n*at every step. In order to get credit, you have to write down all the steps. - You can use SMC or other programs running locally on your computer (but not if they require you to connect to an outside website) to
**check**your work. But no code will be accepted as part of your solutions. - The final exam scores are now in TED.
- The letter grades have been submitted. You should find them in blink as soon as the registrar makes them available.

## Math 187A: Introduction to Cryptography (Winter 2021, lecture A)

This course will be closely coordinated with Alina Bucur's Math 187A course (Lecture B). You may attend either lecture. Most policies, assignments, and deadlines will be the same for both lectures. Discussion sections, office hours, and Zulip will be shared.

Due to the COVID-19 pandemic, this course will be taught remotely and will accommodate participation from any timezone; however, all times will be announced in Pacific Standard Time (PST = UTC-8) except as indicated. You are responsible for meeting all deadlines as announced, regardless of the timezone you are in.

Lectures and discussion sections will be given synchronously, recorded, and made available for later viewing. By attending, **you give permission** to be recorded by the **instructional staff only**, not by other students. If you do not want to be recorded, please keep your audio/video muted or view the recorded lecture after it has been posted. You do **not** have permission to share the recordings or to record any other interactions with the instructor or TAs.

Reminder: please use Zulip private messages to communicate with course staff in place of email.

**Lecture**: MWF 1-1:50pm (link posted on Canvas and Zulip). No lectures on Monday, January 18 or Monday, February 15 (university holidays).

**Instructor**: Kiran S. Kedlaya

Email: [email protected]

Office hours: W 2-3pm, F 3-4pm (links posted on Canvas and Zulip) or by appointment (via Zulip).

Note: Friday office hours will be "Ask Me Anything" sessions.

**Discussion sections**:

Sections takes place Mondays 4-4:50pm (B05), 5-5:50pm (A01/B01), 6-6:50pm (A02/B02), 7-7:50pm (A03/B03), 8-8:50pm (A04/B04). Attending section is not mandatory. You may attend any section, not just the one you are registered for. No sections on Monday, January 18 or Monday, February 15 (university holidays).

TAs: | Poornima B | Mingjie Chen | Jun Bo Lau | Finn McGlade | Baiming Qiao |

B05 | A03/B03 | A04/B04 | A02/B02 | A01/B01 | |

[email protected] | [email protected] | [email protected] | [email protected] | [email protected] | |

OH | Tu 12-2pm | Tu 10-11am, W 10-11am | W 5-7pm, F 5-6pm | Tu 8-10am | W 3-4pm, F 4-5pm |

**Required text**: none. For those who want to read more, a good reference is An Introduction to Mathematical Cryptography by Hoffstein, Pipher and Silverman. (The link provides electronic access through the UCSD Library. You will have to VPN into the UCSD network in order to gain access to it; then click the "SpringerLink" page from the library page.)

**Handouts**: All handouts will be posted to Canvas. This includes lecture notes, lecture recordings, and homework assignments.

**Homework**: There will be 4 assignments in total (due Wednesdays in weeks 2, 4, 6, 8), due at 11:59pm on the indicated date through Gradescope. Before the deadline, you may submit as many copies of your homework paper as you would like; however, only the most recent submission will be considered. **No late homework will be accepted.** If you fail to submit your homework before the deadline, then you will automatically receive a zero for that assignment. The lowest homework score will be dropped; please do not contact course staff to ask for further leniency!

We strongly encourage that you **type your solutions**. Handwritten papers must be legible, or else your homework may not be graded. Homework grades will be available on Gradescope (and later Canvas).

**Quizzes**: There will be 4 quizzes of 20min each (held Wednesdays in weeks 3, 5, 7, 9), administered through Gradescope. There will be a practice quiz during week 1 to help you familiarize yourself with the process. Quizzes will be administered during the two lecture periods (11-11:50am, 1-1:50pm) and at a third time to be announced later.

During each quiz, you may use any resources (notes, books, even search engines) as long as you do not communicate with any other humans. For example, posting a question to Chegg is not permitted.

The lowest quiz score will be dropped. Handwritten papers must be legible, or else your quiz may not be graded. Quiz grades will be available on Gradescope .

**Final project**: due F 3/19/20 at 2:30pm **PDT** (Daylight Saving Time begins 3/14/20). As for quizzes, you may use any resources as long as you do not communicate with any other humans. There is **no final exam**; disregard any information from the registrar to the contrary.

**Grading**: All grades are recorded on Gradescope . **Only grades that appear in Gradescope in week 10 will be included in calculating the total score for the course.**

- 50% homework: the lowest score will be dropped, all others will be weighted equally.
- 25% quizzes: the lowest score will be dropped, all others will be weighted equally.
- 20% final project: cannot be dropped. In addition, you must obtain a passing score on the final project in order to pass the course. (The passing cutoff will be no higher than 65%.)
- 5% participation activities. These will be asynchronous, but there will be time set aside during lectures for them.

**no exceptions**will be granted, nor will there be an opportunity to make up missed work. This applies even if you join the course late.

Any infringement of UCSD's academic integrityor harassmentpolicies, including cheating on a quiz/hw/project, will result in

**failing the class**, as well as further disciplinary action. If you suspect a violation, please bring it to the attention of course staff immediately; we will also be monitoring Cheggand similar sites for suspicious activity.

**There will be no curve in this class, and therefore no pressure to compete against other students.** Grade cutoffs:

Percentage | 97 | 93 | 90 | 87 | 83 | 80 | 77 | 73 | 70 |

Minimum grade | A+ | A | A- | B+ | B | B- | C+ | C | C- |

**Regrade Policy:** If you believe there might be an error in the grading and wish to have your quiz/homework regraded, you must observe the following rules.

- Regrade requests will not be considered later than
*three days*after the grade was originally posted. That means that you should check your scores frequently in order to not miss the reporting window. - If you disagree with the TA's answer to your regrade request, you may ask for the instructor to review it. In order to do this, you must:
- make your request within 24 hours of receiving the TA's answer,
**and** - ask that they forward it to the instructor.

- make your request within 24 hours of receiving the TA's answer,
- Instructor review requests will not be considered later than
**one week**after the grade was posted. - No regrade requests will be considered after week 9, except for the final project.

**Letters of recommendation:** In general, you should try to get a letter of recommendation from a professor with whom you had some one-to-one contact. I will consider recommendation requests only from people who have placed in the top 25% of the class (in the past, this meant a grade of A+) and who have had some nontrivial interaction with me outside lecture (which this quarter amounts to interacting with me during Zoom office hours). See also this page.

**Communication:** Most communication about the course will take place in Zulip; Zulip includes both a general discussion forum, available to all students in both Math 187A lectures, and one-on-one direct messages. A link to join Zulip will be posted to Canvas. Once you have joined, please use DMs instead of email for questions about the course; I may not answer emails. All course communication is subject to UCSD's academic integrity and harassment policies.

**Electronic devices:** On Zoom, please make sure your mic is muted when you don't need to speak. No visual or audio recording is allowed in class/section/office hours without prior permission of the instructor/TA and all other attendees (whether by camera, cell phone, or other means).

### Announcements

- There will be no lectures on Monday, January 18 or Monday, February 15.

## Math 187A: Introduction to Cryptography (Winter 2020)

**Lecture**: MWF 2-2:50pm in Center Hall, room 115

**Instructor**: Alina Bucur

Office: AP&M 7151

Email: [email protected]

Office hours: M 3:30-5:30pm or by appointment

**Discussion sections**: Everyone is expected to attend the section they are registered for. Attending section is not mandatory, but if you do attend, you have to go to the section you are registered in. Only students registered in that section will be allowed in the discussion classroom. Quizzes will be returned in discussion to the students registered in that section. Please check blink for your discussion time.

TAs: | Daniel Copeland | Randy Martinez | Mozhgan Mirzaei | Bharatha Rankothge | Peter Wear |

A01 | A02 | A05, A06 | A03 | A04 | |

[email protected] | [email protected] | [email protected] | [email protected] | [email protected] | |

OH | W 3:30-5:30pm | F 10-11am, 1-2pm | Tu 10am-12pm | Tu 1:50-3:50pm | Th 3:30-5:30pm |

APM 6218 | APM 5218 | APM 5748 | APM 6436 | APM 5760 |

**Required text**: none. Notes will be provided as handouts in class and/or online. For those who want to read more, a good reference is An introduction to mathematical cryptography by Hoffstein, Pipher and Silverman. (The link provides electronic access through UCSD library.)

**Handouts**: You will need a username and password to access this part of the website. The credentials will be posted in TritonEd.

**Quizzes**: There will be 6-8 quizzes administered Fridays during lecture. Sample quizzes will be posted on Friday the previous week.

**Homework**: There will be 1-2 computer assignments, one of which will be on codebreaking using the applets. Each computer assignment counts as one quiz.

**Final exam**: M 3/16/20 3-6pm, location TBA. *Please note that by signing up for this course, you are agreeing to sit for the final examination at this date and time.* The exam is not cumulative and it counts as 3 quizzes. This grade cannot be dropped. **You do not need to bring a blue book to the final.**

**Grading**: All grades are recorded on TritonED. **Only grades that appear in TritonED will be included in calculating the total score for the course.**

The final will be worth as much as 3 quizzes. The computer assignment(s) count as 1 quiz (each). **It is your responsibility to make sure your grades are recorded in TritonED. **If you do not have access to TritonED, make sure you get it by Wednesday Jan 17. **All tests will be open books and open notes.** You will not need a computer for the any of the tests, but a calculator might be useful for some of the tests. If you do use a computer, you can **only** access the class website. No other websites, no messaging, no search engines, no communication of any sort with any other people, be they friends or enemies.**The lowest quiz score will be dropped.** If you miss one quiz, your score will be 0 on it and that will automatically become your lowest quiz score and be dropped. The final exam grade will not be dropped under any circumstances.

No make-up exams and no make-up quizzes will be given.

Cheating on an exam/quiz or any infringement of UCSD's academic integrity or harassment policies will result in **failing the class**, as well as further disciplinary action. If you suspect a violation, please bring it to the attention of the instructor and/or TA immediately.

**Grade Recording Errors:** Keep all of your returned quizzes and homeworks. If there is any mistake in the recording of your scores, you will need the original assignment/quiz in order for us to make a change. The error has to be reported *within 1 week* since it occurred. No error reports will be accepted after week #9 of the term.

**Regrade Policy:** All graded material (except the final) will be returned in discussion sections. If you believe there might be an error in the grading and wish to have your quiz/homework regraded, you must observe the following rules.

- Return your test immediately to your TA. Regrade requests will not be considered once the test leaves the room.
- If you disagree with the TA's answer to your regrade request, you may ask for the instructor to review it. In order to do this, you must:
- return your test immediately to your TA and
- ask that they forward it to the instructor.

- Instructor review requests will not be considered once the test leaves the room.

- If you disagree with the TA's answer to your regrade request, you may ask for the instructor to review it. In order to do this, you must:
- Retrieve your test during discussion section or arrange to pick it up from your TA within one week after it was made available for pickup (i.e., returned) in section. In order to be considered, regrade requests must be submitted within one week after being returned in section.

**Letters of recommendation:** In general, you should try to get a letter of recommendation from a professor with whom you had some one-to-one contact. I will consider recommendation requests only from people who have placed in the top 25% of the class (in the past, this meant a grade of A+) and who have had some nontrivial interaction with me outside lecture.

**Communication:** I am happy to talk/answer questions right before and after class or during office hours. If you cannot make the office hours posted, email me to make an appointment. Due to the large size of the class, I will not respond to email unless it is a request to set up an appointment. If you email me with a general question, the answer might be an update to the website for the benefit of anyone with the same question!

**Electronic devices:** Please do not use devices (such as cell phones, laptops, tablets, iPods) for non-class-related matters while in class/section. No visual or audio recording is allowed in class/section without prior permission of the instructor (whether by camera, cell phone, or other means).

### Announcements

- There will be no lectures on the following university holidays: M 1/20 (Martin Luther King Day); M 2/17 (Presidents Day).
- The discussion sections A01 and A02 have been moved to SOLIS 105. The entrance to SOLIS 105 is located on the southeast side of Solis Hall, facing the Cognitive Science Building and Geisel library.
- TA's office hours will run starting week 2 according to the schedule above.
- The last quiz will be on Friday 3/6.
- Special guest lecture on M 3/9 about zero knowledge by Alyson Deines (Institute for Defense Analyses).
- During week 10 we will not observe the usual office hours schedule. Instead, Mozhgan will hold a
**review session Sunday 2-4pm (APM 6402)**and office hours will be held as follows.- Tuesday 1:50-3:30pm (Randy)
- Friday 10-11am, 1-2pm (Bharatha)
- Friday 4-5pm (Daniel)
- Saturday 4-7pm (Peter)
- Sunday 11am-2pm (Alina)
- Sunday 4-5pm (Mozhgan APM 6402)
- Sunday 6-8pm (Daniel)

## Mathematics

[ undergraduate program | graduate program | faculty ]

*All courses, faculty listings, and curricular and degree requirements described herein are subject to change or deletion without notice. *

### Courses

*For course descriptions not found in the *UC San Diego General Catalog 2021–22*, please contact the department for more information.*

All prerequisites listed below may be replaced by an equivalent or higher-level course. The listings of quarters in which courses will be offered are only tentative. Please consult the Department of Mathematics to determine the actual course offerings each year.

### Lower Division

MATH 2. Introduction to College Mathematics (4)

A highly adaptive course designed to build on students’ strengths while increasing overall mathematical understanding and skill. This multimodality course will focus on several topics of study designed to develop conceptual understanding and mathematical relevance: linear relationships; exponents and polynomials; rational expressions and equations; models of quadratic and polynomial functions and radical equations; exponential and logarithmic functions; and geometry and trigonometry. Workload credit only—not for baccalaureate credit. ** Prerequisites:** Math Placement Exam qualifying score.

MATH 3C. Precalculus (4)

Functions and their graphs. Linear and polynomial functions, zeroes, inverse functions, exponential and logarithmic, trigonometric functions and their inverses. Emphasis on understanding algebraic, numerical and graphical approaches making use of graphing calculators. (No credit given if taken after MATH 4C, 1A/10A, or 2A/20A.) Three or more years of high school mathematics or equivalent recommended. ** Prerequisites:** Math Placement Exam qualifying score, or ACT Math score of 22 or higher, or SAT Math score of 600 or higher.

MATH 4C. Precalculus for Science and Engineering (4)

Review of polynomials. Graphing functions and relations: graphing rational functions, effects of linear changes of coordinates. Circular functions and right triangle trigonometry. Reinforcement of function concept: exponential, logarithmic, and trigonometric functions. Vectors. Conic sections. Polar coordinates. (No credit given if taken after MATH 1A/10A or 2A/20A. Two units of credit given if taken after MATH 3C.) Three or more years of high school mathematics or equivalent recommended. ** Prerequisites:** Math Placement Exam qualifying score, or MATH 3C, or ACT Math score of 25 or higher, or AP Calculus AB score (or subscore) of 2.

MATH 10A. Calculus I (4)

Differential calculus of functions of one variable, with applications. Functions, graphs, continuity, limits, derivatives, tangent lines, optimization problems. (No credit given if taken after or concurrent with MATH 20A.) ** Prerequisites:** Math Placement Exam qualifying score, or AP Calculus AB score of 2, or SAT II Math Level 2 score of 600 or higher, or MATH 3C, or MATH 4C.

MATH 10B. Calculus II (4)

Integral calculus of functions of one variable, with applications. Antiderivatives, definite integrals, the Fundamental Theorem of Calculus, methods of integration, areas and volumes, separable differential equations. (No credit given if taken after or concurrent with MATH 20B.) ** Prerequisites:** AP Calculus AB score of 3, 4, or 5 (or equivalent AB subscore on BC exam), or MATH 10A, or MATH 20A.

MATH 10C. Calculus III (4)

Introduction to functions of more than one variable. Vector geometry, partial derivatives, velocity and acceleration vectors, optimization problems. (No credit given if taken after or concurrent with 20C.) ** Prerequisites:** AP Calculus BC score of 3, 4, or 5, or MATH 10B, or MATH 20B.

MATH 11. Calculus-Based Introductory Probability and Statistics (5)

Events and probabilities, conditional probability, Bayes’ formula. Discrete and continuous random variables: mean, variance; binomial, Poisson distributions, normal, uniform, exponential distributions, central limit theorem. Sample statistics, confidence intervals, hypothesis testing, regression. Applications. Introduction to software for probabilistic and statistical analysis. Emphasis on connections between probability and statistics, numerical results of real data, and techniques of data analysis. ** Prerequisites:**AP Calculus BC score of 3, 4, or 5, or MATH 10B or MATH 20B.

MATH 15A. Introduction to Discrete Mathematics (4)

Basic discrete mathematical structure: sets, relations, functions, sequences, equivalence relations, partial orders, and number systems. Methods of reasoning and proofs: propositional logic, predicate logic, induction, recursion, and pigeonhole principle. Infinite sets and diagonalization. Basic counting techniques; permutation and combinations. Applications will be given to digital logic design, elementary number theory, design of programs, and proofs of program correctness. Students who have completed MATH 109 may not receive credit for MATH 15A. Credit not offered for both MATH 15A and CSE 20. Equivalent to CSE 20. ** Prerequisites:** CSE 8B or CSE 11. Prerequisite courses must be completed with a grade of C– or better.

MATH 18. Linear Algebra (4)

Matrix algebra, Gaussian elimination, determinants. Linear and affine subspaces, bases of Euclidean spaces. Eigenvalues and eigenvectors, quadratic forms, orthogonal matrices, diagonalization of symmetric matrices. Applications. Computing symbolic and graphical solutions using MATLAB. Students may not receive credit for both MATH 18 and 31AH. ** Prerequisites:** Math Placement Exam qualifying score, or AP Calculus AB score of 3 (or equivalent AB subscore on BC exam), or SAT II Math Level 2 score of 650 or higher, or MATH 4C, or MATH 10A, or MATH 20A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 20A. Calculus for Science and Engineering (4)

Foundations of differential and integral calculus of one variable. Functions, graphs, continuity, limits, derivative, tangent line. Applications with algebraic, exponential, logarithmic, and trigonometric functions. Introduction to the integral. (Two credits given if taken after MATH 1A/10A and no credit given if taken after MATH 1B/10B or MATH 1C/10C. Formerly numbered MATH 2A.) ** Prerequisites:** Math Placement Exam qualifying score, or AP Calculus AB score of 3 (or equivalent AB subscore on BC exam), or SAT II MATH 2C score of 650 or higher, or MATH 4C or MATH 10A.

MATH 20B. Calculus for Science and Engineering (4)

Integral calculus of one variable and its applications, with exponential, logarithmic, hyperbolic, and trigonometric functions. Methods of integration. Infinite series. Polar coordinates in the plane and complex exponentials. (Two units of credits given if taken after MATH 1B/10B or MATH 1C/10C.)** Prerequisites:** AP Calculus AB score of 4 or 5, or AP Calculus BC score of 3, or MATH 20A with a grade of C– or better, or MATH 10B with a grade of C– or better, or MATH 10C with a grade of C– or better.

MATH 20C. Calculus and Analytic Geometry for Science and Engineering (4)

Vector geometry, vector functions and their derivatives. Partial differentiation. Maxima and minima. Double integration. (Two units of credit given if taken after MATH 10C. Credit not offered for both MATH 20C and 31BH. Formerly numbered MATH 21C.) ** Prerequisites:** AP Calculus BC score of 4 or 5, or MATH 20B with a grade of C– or better.

MATH 20D. Introduction to Differential Equations (4)

Ordinary differential equations: exact, separable, and linear; constant coefficients, undetermined coefficients, variations of parameters. Systems. Series solutions. Laplace transforms. Techniques for engineering sciences. Computing symbolic and graphical solutions using MATLAB. (Formerly numbered MATH 21D.) May be taken as repeat credit for MATH 21D.** Prerequisites:** MATH 20C (or MATH 21C) or MATH 31BH with a grade of C– or better.

MATH 20E. Vector Calculus (4)

Change of variable in multiple integrals, Jacobian, Line integrals, Green’s theorem. Vector fields, gradient fields, divergence, curl. Spherical/cylindrical coordinates. Taylor series in several variables. Surface integrals, Stoke’s theorem. Gauss’ theorem. Conservative fields. ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH and MATH 20C (or MATH 21C) or MATH 31BH with a grade of C– or better.

MATH 31AH. Honors Linear Algebra (4)

First quarter of three-quarter honors integrated linear algebra/multivariable calculus sequence for well-prepared students. Topics include real/complex number systems, vector spaces, linear transformations, bases and dimension, change of basis, eigenvalues, eigenvectors, diagonalization. (Credit not offered for both MATH 31AH and 20F.) ** Prerequisites:** AP Calculus BC score of 5 or consent of instructor.

MATH 31BH. Honors Multivariable Calculus (4)

Second quarter of three-quarter honors integrated linear algebra/multivariable calculus sequence for well-prepared students. Topics include derivative in several variables, Jacobian matrices, extrema and constrained extrema, integration in several variables. (Credit not offered for both MATH 31BH and 20C.) ** Prerequisites:** MATH 31AH with a grade of B– or better, or consent of instructor.

MATH 31CH. Honors Vector Calculus (4)

Third quarter of honors integrated linear algebra/multivariable calculus sequence for well-prepared students. Topics include change of variables formula, integration of differential forms, exterior derivative, generalized Stoke’s theorem, conservative vector fields, potentials. ** Prerequisites:** MATH 31BH with a grade of B– or better, or consent of instructor.

MATH 87. First-year Student Seminar (1)

The First-year Student Seminar Program is designed to provide new students with the opportunity to explore an intellectual topic with a faculty member in a small seminar setting. First-year student seminars are offered in all campus departments and undergraduate colleges, and topics vary from quarter to quarter. Enrollment is limited to fifteen to twenty students, with preference given to entering first-year students. ** Prerequisites:** none.

MATH 95. Introduction to Teaching Math (2)

(Cross-listed with EDS 30.) Revisit students’ learning difficulties in mathematics in more depth to prepare students to make meaningful observations of how K–12 teachers deal with these difficulties. Explore how instruction can use students’ knowledge to pose problems that stimulate students’ intellectual curiosity. ** Prerequisites:** none.

MATH 96. Putnam Seminar (1)

Students will develop skills in analytical thinking as they solve and present solutions to challenging mathematical problems in preparation for the William Lowell Putnam Mathematics Competition, a national undergraduate mathematics examination held each year. Students must sit for at least one half of the Putnam exam (given the first Saturday in December) to receive a passing grade. P/NP grades only. May be taken for credit up to four times. ** Prerequisites:** AP Calculus AB score of 4 or more, or AP Calculus BC score of 3 or more, or MATH 20A.

MATH 99R. Independent Study (1)

Independent study or research under direction of a member of the faculty. ** Prerequisites:** Must be of first-year standing and a Regent’s Scholar.

### Upper Division

MATH 100A. Abstract Algebra I (4)

First course in a rigorous three-quarter introduction to the methods and basic structures of higher algebra. Topics include groups, subgroups and factor groups, homomorphisms, rings, fields. (Students may not receive credit for both MATH 100A and MATH 103A.) ** Prerequisites:** MATH 31CH or MATH 109 or consent of instructor.

MATH 100B. Abstract Algebra II (4)

Second course in a rigorous three-quarter introduction to the methods and basic structures of higher algebra. Topics include rings (especially polynomial rings) and ideals, unique factorization, fields; linear algebra from perspective of linear transformations on vector spaces, including inner product spaces, determinants, diagonalization. (Students may not receive credit for both MATH 100B and MATH 103B.) ** Prerequisites:**MATH 100A or consent of instructor.

MATH 100C. Abstract Algebra III (4)

Third course in a rigorous three-quarter introduction to the methods and basic structures of higher algebra. Topics include linear transformations, including Jordan canonical form and rational canonical form; Galois theory, including the insolvability of the quintic. ** Prerequisites:** MATH 100B or consent of instructor.

MATH 102. Applied Linear Algebra (4)

Second course in linear algebra from a computational yet geometric point of view. Elementary Hermitian matrices, Schur’s theorem, normal matrices, and quadratic forms. Moore-Penrose generalized inverse and least square problems. Vector and matrix norms. Characteristic and singular values. Canonical forms. Determinants and multilinear algebra. ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH and MATH 20C. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 103A. Modern Algebra I (4)

First course in a two-quarter introduction to abstract algebra with some applications. Emphasis on group theory. Topics include definitions and basic properties of groups, properties of isomorphisms, subgroups. (Students may not receive credit for both MATH 100A and MATH 103A.) ** Prerequisites:** MATH 31CH or MATH 109 or consent of instructor.

MATH 103B. Modern Algebra II (4)

Second course in a two-quarter introduction to abstract algebra with some applications. Emphasis on rings and fields. Topics include definitions and basic properties of rings, fields, and ideals, homomorphisms, irreducibility of polynomials. (Students may not receive credit for both MATH 100B and MATH 103B.) ** Prerequisites:** MATH 103A or MATH 100A or consent of instructor.

MATH 104A. Number Theory I (4)

Elementary number theory with applications. Topics include unique factorization, irrational numbers, residue systems, congruences, primitive roots, reciprocity laws, quadratic forms, arithmetic functions, partitions, Diophantine equations, distribution of primes. Applications include fast Fourier transform, signal processing, codes, cryptography. ** Prerequisites:** MATH 100B or MATH 103B. Students who have not completed the listed prerequisite(s) may enroll with consent of instructor.

MATH 104B. Number Theory II (4)

Topics in number theory such as finite fields, continued fractions, Diophantine equations, character sums, zeta and theta functions, prime number theorem, algebraic integers, quadratic and cyclotomic fields, prime ideal theory, class number, quadratic forms, units, Diophantine approximation, *p*-adic numbers, elliptic curves. ** Prerequisites:** MATH 104A or consent of instructor.

MATH 104C. Number Theory III (4)

Topics in algebraic and analytic number theory, with an advanced treatment of material listed for MATH 104B. ** Prerequisites:** Math 104B or consent of instructor.

MATH 105. Basic Number Theory (4)

The course will cover the basic arithmetic properties of the integers, with applications to Diophantine equations and elementary Diophantine approximation theory. **Prerequisites:**MATH 31CH or MATH 109. Students who have not completed the listed prerequisites may enroll with consent of instructor.

MATH 106. Introduction to Algebraic Geometry (4)

Plane curves, Bezout’s theorem, singularities of plane curves. Affine and projective spaces, affine and projective varieties. Examples of all the above. Instructor may choose to include some commutative algebra or some computational examples. **Prerequisites:**MATH 100B or MATH 103B. Students who have not completed the listed prerequisites may enroll with consent of instructor.

MATH 109. Mathematical Reasoning (4)

This course uses a variety of topics in mathematics to introduce the students to rigorous mathematical proof, emphasizing quantifiers, induction, negation, proof by contradiction, naive set theory, equivalence relations and epsilon-delta proofs. Required of all departmental majors. ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH, and MATH 20C. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 110. Introduction to Partial Differential Equations (4)

An introduction to partial differential equations focusing on equations in two variables. Topics include the heat and wave equation on an interval, Laplace’s equation on rectangular and circular domains, separation of variables, boundary conditions and eigenfunctions, introduction to Fourier series, software methods for solving equations. Formerly MATH 110A. (Students may not receive credit for MATH 110 and MATH 110A.) ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH and MATH 20D and MATH 20E or MATH 31CH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 111A. Mathematical Modeling I (4)

An introduction to mathematical modeling in the physical and social sciences. Topics vary, but have included mathematical models for epidemics, chemical reactions, political organizations, magnets, economic mobility, and geographical distributions of species. May be taken for credit two times when topics change. ** Prerequisites:**MATH 20D, MATH 18 or MATH 20F or MATH 31AH, and MATH 109 or MATH 31CH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 111B. Mathematical Modeling II (4)

Continued study on mathematical modeling in the physical and social sciences, using advanced techniques that will expand upon the topics selected and further the mathematical theory presented in MATH 111A. ** Prerequisites:** MATH 111A or consent of instructor.

MATH 112A. Introduction to Mathematical Biology I (4)

Part one of a two-course introduction to the use of mathematical theory and techniques in analyzing biological problems. Topics include differential equations, dynamical systems, and probability theory applied to a selection of biological problems from population dynamics, biochemical reactions, biological oscillators, gene regulation, molecular interactions, and cellular function. May be coscheduled with MATH 212A. Recommended preparation: MATH 130 and MATH 180A. **Prerequisites:**MATH 11 or MATH 180A or MATH 183 or MATH 186, and MATH 18 or MATH 31AH, and MATH 20D, and BILD 1. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 112B. Introduction to Mathematical Biology II (4)

Part two of an introduction to the use of mathematical theory and techniques in analyzing biological problems. Topics include partial differential equations and stochastic processes applied to a selection of biological problems, especially those involving spatial movement, such as molecular diffusion, bacterial chemotaxis, tumor growth, and biological patterns. May be coscheduled with MATH 212B. Recommended preparation: MATH 180B. **Prerequisites:**MATH 112A and MATH 110 and MATH 180A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 114. Introduction to Computational Stochastics (4)

Topics include random number generators, variance reduction, Monte Carlo (including Markov Chain Monte Carlo) simulation, and numerical methods for stochastic differential equations. Methods will be illustrated on applications in biology, physics, and finance. May be coscheduled with MATH 214. Recommended preparation: CSE 5A, CSE 8A, CSE 11, or ECE 15. Students should complete a computer programming course before enrolling in MATH 114. **Prerequisites:** MATH 180A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 120A. Elements of Complex Analysis (4)

Complex numbers and functions. Analytic functions, harmonic functions, elementary conformal mappings. Complex integration. Power series. Cauchy’s theorem. Cauchy’s formula. Residue theorem.** Prerequisites:**MATH 20E or MATH 31CH, or consent of instructor.

MATH 120B. Applied Complex Analysis (4)

Applications of the residue theorem. Conformal mapping and applications to potential theory, flows, and temperature distributions. Fourier transformations. Laplace transformations, and applications to integral and differential equations. Selected topics such as Poisson’s formula, Dirichlet’s problem, Neumann’s problem, or special functions. ** Prerequisites:** MATH 120A or consent of instructor.

MATH 121A. Foundations of Teaching and Learning Mathematics I (4)

(Cross-listed with EDS 121A.) Develop teachers’ knowledge base (knowledge of mathematics content, pedagogy, and student learning) in the context of advanced mathematics. This course builds on the previous courses where these components of knowledge were addressed exclusively in the context of high-school mathematics. ** Prerequisites:** EDS 30/MATH 95, Calculus 10C or 20C.

MATH 121B. Foundations of Teaching and Learning Math II (4)

(Cross-listed with EDS 121B.) Examine how learning theories can consolidate observations about conceptual development with the individual student as well as the development of knowledge in the history of mathematics. Examine how teaching theories explain the effect of teaching approaches addressed in the previous courses. ** Prerequisites:** EDS 121A/MATH 121A.

MATH 130. Differential Equations and Dynamical Systems (4)

An introduction to ordinary differential equations from the dynamical systems perspective. Topics include flows on lines and circles, two-dimensional linear systems and phase portraits, nonlinear planar systems, index theory, limit cycles, bifurcation theory, applications to biology, physics, and electrical engineering. Formerly MATH 130A. (Students may not receive credit for MATH 130 and MATH 130A.) ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH and MATH 20D. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 140A. Foundations of Real Analysis I (4)

First course in a rigorous three-quarter sequence on real analysis. Topics include the real number system, basic topology, numerical sequences and series, continuity. (Students may not receive credit for both MATH 140A and MATH 142A.) ** Prerequisites:**MATH 31CH or MATH 109. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 140B. Foundations of Real Analysis II (4)

Second course in a rigorous three-quarter sequence on real analysis. Topics include differentiation, the Riemann-Stieltjes integral, sequences and series of functions, power series, Fourier series, and special functions. (Students may not receive credit for both MATH 140B and MATH 142B.) ** Prerequisites:** MATH 140A or consent of instructor.

MATH 140C. Foundations of Real Analysis III (4)

Third course in a rigorous three-quarter sequence on real analysis. Topics include differentiation of functions of several real variables, the implicit and inverse function theorems, the Lebesgue integral, infinite-dimensional normed spaces. ** Prerequisites:** MATH 140B or consent of instructor.

MATH 142A. Introduction to Analysis I (4)

First course in an introductory two-quarter sequence on analysis. Topics include the real number system, numerical sequences and series, infinite limits, limits of functions, continuity, differentiation. Students may not receive credit for MATH 142A if taken after or concurrently with MATH 140A. ** Prerequisites:** MATH 31CH or MATH 109. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 142B. Introduction to Analysis II (4)

Second course in an introductory two-quarter sequence on analysis. Topics include the Riemann integral, sequences and series of functions, uniform convergence, Taylor series, introduction to analysis in several variables. Students may not receive credit for MATH 142B if taken after or concurrently with MATH 140B. ** Prerequisites:** MATH 142A or MATH 140A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 144. Introduction to Fourier Analysis (4)

Rigorous introduction to the theory of Fourier series and Fourier transforms. Topics include basic properties of Fourier series, mean square and pointwise convergence, Hilbert spaces, applications of Fourier series, the Fourier transform on the real line, inversion formula, Plancherel formula, Poisson summation formula, Heisenberg uncertainty principle, applications of the Fourier transform. **Prerequisites:** MATH 140B or MATH 142B. Students who have not completed listed prerequisite(s) may enroll with the consent of instructor.

MATH 146. Analysis of Ordinary Differential Equations (4)

A rigorous introduction to systems of ordinary differential equations. Topics include linear systems, matrix diagonalization and canonical forms, matrix exponentials, nonlinear systems, existence and uniqueness of solutions, linearization, and stability. **Prerequisites:**MATH 140B or MATH 142B. Students who have not completed listed prerequisite(s) may enroll with the consent of instructor.

MATH 148. Analysis of Partial Differential Equations (4)

A rigorous introduction to partial differential equations. Topics include initial and boundary value problems; first order linear and quasilinear equations, method of characteristics; wave and heat equations on the line, half-line, and in space; separation of variables for heat and wave equations on an interval and for Laplace’s equation on rectangles and discs; eigenfunctions of the Laplacian and heat, wave, Poisson’s equations on bounded domains; and Green’s functions and distributions. **Prerequisites:**MATH 140B or MATH 142B. Students who have not completed listed prerequisite(s) may enroll with the consent of instructor.

MATH 150A. Differential Geometry (4)

Differential geometry of curves and surfaces. Gauss and mean curvatures, geodesics, parallel displacement, Gauss-Bonnet theorem. ** Prerequisites:** MATH 20E or MATH 31CH and either MATH 18 or MATH 20F or MATH 31AH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 150B. Calculus on Manifolds (4)

Calculus of functions of several variables, inverse function theorem. Further topics may include exterior differential forms, Stokes’ theorem, manifolds, Sard’s theorem, elements of differential topology, singularities of maps, catastrophes, further topics in differential geometry, topics in geometry of physics. ** Prerequisites:** MATH 150A or consent of instructor.

MATH 152. Applicable Mathematics and Computing (4)

This course will give students experience in applying theory to real world applications such as internet and wireless communication problems. The course will incorporate talks by experts from industry and students will be helped to carry out independent projects. Topics include graph visualization, labelling, and embeddings, random graphs and randomized algorithms. May be taken for credit three times.** Prerequisites:**MATH 20D and either MATH 18 or MATH 20F or MATH 31AH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 153. Geometry for Secondary Teachers (4)

Two- and three-dimensional Euclidean geometry is developed from one set of axioms. Pedagogical issues will emerge from the mathematics and be addressed using current research in teaching and learning geometry. This course is designed for prospective secondary school mathematics teachers. ** Prerequisites:** MATH 109 or MATH 31CH, or consent of instructor.

MATH 154. Discrete Mathematics and Graph Theory (4)

Basic concepts in graph theory, including trees, walks, paths, and connectivity, cycles, matching theory, vertex and edge-coloring, planar graphs, flows and combinatorial algorithms, covering Hall’s theorems, the max-flow min-cut theorem, Euler’s formula, and the travelling salesman problem. Credit not offered for MATH 154 if MATH 158 is previously taken. If MATH 154 and MATH 158 are concurrently taken, credit is only offered for MATH 158. ** Prerequisites:** MATH 31CH or MATH 109. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 155A. Geometric Computer Graphics (4)

Bezier curves and control lines, de Casteljau construction for subdivision, elevation of degree, control points of Hermite curves, barycentric coordinates, rational curves. Programming knowledge recommended. (Students may not receive credit for both MATH 155A and CSE 167.) ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH, and MATH 20C. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 155B. Topics in Computer Graphics (4)

Spline curves, NURBS, knot insertion, spline interpolation, illumination models, radiosity, and ray tracing. ** Prerequisites:** MATH 155A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 157. Introduction to Mathematical Software (4)

A hands-on introduction to the use of a variety of open-source mathematical software packages, as applied to a diverse range of topics within pure and applied mathematics. Most of these packages are built on the Python programming language, but experience with another common programming language is acceptable. All software will be accessed using the CoCalc web platform (http://cocalc.com), which provides a uniform interface through any web browser.*Prerequisites:* MATH 20D and MATH 18 or MATH 20F or MATH 31AH and one of COGS 18 or CSE 5A or CSE 8A or CSE 11 or DSC 10 or ECE 15 or ECE 143 or MATH 189. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 158. Extremal Combinatorics and Graph Theory (4)

Extremal combinatorics is the study of how large or small a finite set can be under combinatorial restrictions. We will give an introduction to graph theory, connectivity, coloring, factors, and matchings, extremal graph theory, Ramsey theory, extremal set theory, and an introduction to probabilistic combinatorics. Topics include Turan’s theorem, Ramsey’s theorem, Dilworth’s theorem, and Sperner’s theorem. Credit not offered for MATH 158 if MATH 154 was previously taken. If MATH 154 and MATH 158 are concurrently taken, credit is only offered for MATH 158. A strong performance in MATH 109 or MATH 31CH is recommended. **Prerequisites:** MATH 31CH or MATH 109. Students who have not completed the listed prerequisites may enroll with consent of instructor.

MATH 160A. Elementary Mathematical Logic I (4)

An introduction to recursion theory, set theory, proof theory, model theory. Turing machines. Undecidability of arithmetic and predicate logic. Proof by induction and definition by recursion. Cardinal and ordinal numbers. Completeness and compactness theorems for propositional and predicate calculi. ** Prerequisites:** MATH 100A, or MATH 103A, or MATH 140A, or consent of instructor.

MATH 160B. Elementary Mathematical Logic II (4)

A continuation of recursion theory, set theory, proof theory, model theory. Turing machines. Undecidability of arithmetic and predicate logic. Proof by induction and definition by recursion. Cardinal and ordinal numbers. Completeness and compactness theorems for propositional and predicate calculi. ** Prerequisites:** MATH 160A or consent of instructor.

MATH 163. History of Mathematics (4)

Topics will vary from year to year in areas of mathematics and their development. Topics may include the evolution of mathematics from the Babylonian period to the eighteenth century using original sources, a history of the foundations of mathematics and the development of modern mathematics. ** Prerequisites:** MATH 20B or consent of instructor.

MATH 168A. Topics in Applied Mathematics—Computer Science (4)

Topics to be chosen in areas of applied mathematics and mathematical aspects of computer science. May be taken for credit two times with different topics. ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH, and MATH 20C. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 170A. Introduction to Numerical Analysis: Linear Algebra (4)

Analysis of numerical methods for linear algebraic systems and least squares problems. Orthogonalization methods. Ill conditioned problems. Eigenvalue and singular value computations. Knowledge of programming recommended. ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH, and MATH 20C or MATH 31BH. Students who have not completed the listed prerequisites may enroll with consent of instructor.

MATH 170B. Introduction to Numerical Analysis: Approximation and Nonlinear Equations (4)

Rounding and discretization errors. Calculation of roots of polynomials and nonlinear equations. Interpolation. Approximation of functions. Knowledge of programming recommended. ** Prerequisites:** MATH 170A.

MATH 170C. Introduction to Numerical Analysis: Ordinary Differential Equations (4)

Numerical differentiation and integration. Ordinary differential equations and their numerical solution. Basic existence and stability theory. Difference equations. Boundary value problems. ** Prerequisites:** MATH 20D or 21D and MATH 170B, or consent of instructor.

MATH 171A. Introduction to Numerical Optimization: Linear Programming (4)

Linear optimization and applications. Linear programming, the simplex method, duality. Selected topics from integer programming, network flows, transportation problems, inventory problems, and other applications. Three lectures, one recitation. Knowledge of programming recommended. (Credit not allowed for both MATH 171A and ECON 172A.) ** Prerequisites:** MATH 18 or MATH 20F or MATH 31AH, and MATH 20C. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 171B. Introduction to Numerical Optimization: Nonlinear Programming (4)

Convergence of sequences in Rn, multivariate Taylor series. Bisection and related methods for nonlinear equations in one variable. Newton’s methods for nonlinear equations in one and many variables. Unconstrained optimization and Newton’s method. Equality-constrained optimization, Kuhn-Tucker theorem. Inequality-constrained optimization. Three lectures, one recitation. Knowledge of programming recommended. (Credit not allowed for both MATH 171B and ECON 172B.) ** Prerequisites:** MATH 171A or consent of instructor.

MATH 173A. Optimization Methods for Data Science I (4)

Introduction to convexity: convex sets, convex functions; geometry of hyperplanes; support functions for convex sets; hyperplanes and support vector machines. Linear and quadratic programming: optimality conditions; duality; primal and dual forms of linear support vector machines; active-set methods; interior methods. ** Prerequisites:** MATH 20C or MATH 31BH and MATH 18 or 20F or 31AH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 173B. Optimization Methods for Data Science II (4)

Unconstrained optimization: linear least squares; randomized linear least squares; method(s) of steepest descent; line-search methods; conjugate-gradient method; comparing the efficiency of methods; randomized/stochastic methods; nonlinear least squares; norm minimization methods. Convex constrained optimization: optimality conditions; convex programming; Lagrangian relaxation; the method of multipliers; the alternating direction method of multipliers; minimizing combinations of norms. ** Prerequisites:** MATH 173A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 174. Numerical Methods for Physical Modeling (4)

(Conjoined with MATH 274.) Floating point arithmetic, direct and iterative solution of linear equations, iterative solution of nonlinear equations, optimization, approximation theory, interpolation, quadrature, numerical methods for initial and boundary value problems in ordinary differential equations. (Students may not receive credit for both MATH 174 and PHYS 105, AMES 153 or 154. Students may not receive credit for MATH 174 if MATH 170A, B, or C has already been taken.) Graduate students will do an extra assignment/exam. ** Prerequisites:** Math 20D or MATH 21D, and either MATH 20F or MATH 31AH, or consent of instructor.

MATH 175. Numerical Methods for Partial Differential Equations (4)

(Conjoined with MATH 275.) Mathematical background for working with partial differential equations. Survey of finite difference, finite element, and other numerical methods for the solution of elliptic, parabolic, and hyperbolic partial differential equations. (Formerly MATH 172. Students may not receive credit for MATH 175/275 and MATH 172.) Graduate students do an extra paper, project, or presentation, per instructor. ** Prerequisites:** MATH 174 or MATH 274, or consent of instructor.

MATH 179. Projects in Computational and Applied Mathematics (4)

(Conjoined with MATH 279.) Mathematical models of physical systems arising in science and engineering, good models and well-posedness, numerical and other approximation techniques, solution algorithms for linear and nonlinear approximation problems, scientific visualizations, scientific software design and engineering, project-oriented. Graduate students will do an extra paper, project, or presentation per instructor. ** Prerequisites:** MATH 174 or MATH 274 or consent of instructor.

MATH 180A. Introduction to Probability (4)

Probability spaces, random variables, independence, conditional probability, distribution, expectation, variance, joint distributions, central limit theorem. (Two units of credit offered for MATH 180A if ECON 120A previously, no credit offered if ECON 120A concurrently. Two units of credit offered for MATH 180A if MATH 183 or 186 taken previously or concurrently.) Prior or concurrent enrollment in MATH 109 is highly recommended. ** Prerequisites:**Math 20C or MATH 31BH, or consent of instructor.

MATH 180B. Introduction to Stochastic Processes I (4)

Random vectors, multivariate densities, covariance matrix, multivariate normal distribution. Random walk, Poisson process. Other topics if time permits. ** Prerequisites:** MATH 20D and either MATH 18 or MATH 20F or MATH 31AH, and MATH 109 or MATH 31CH, and MATH 180A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 180C. Introduction to Stochastic Processes II (4)

Markov chains in discrete and continuous time, random walk, recurrent events. If time permits, topics chosen from stationary normal processes, branching processes, queuing theory. ** Prerequisites:** MATH 180B or consent of instructor.

MATH 181A. Introduction to Mathematical Statistics I (4)

Multivariate distribution, functions of random variables, distributions related to normal. Parameter estimation, method of moments, maximum likelihood. Estimator accuracy and confidence intervals. Hypothesis testing, type I and type II errors, power, one-sample t-test. Prior or concurrent enrollment in MATH 109 is highly recommended. ** Prerequisites:**MATH 180A, and MATH 18 or MATH 20F or MATH 31AH, and MATH 20C. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 181B. Introduction to Mathematical Statistics II (4)

Hypothesis testing. Linear models, regression, and analysis of variance. Goodness of fit tests. Nonparametric statistics. Two units of credit offered for MATH 181B if ECON 120B previously; no credit offered if ECON 120B concurrently. Prior enrollment in MATH 109 is highly recommended. ** Prerequisites:** MATH 181A or consent of instructor.

MATH 181C. Mathematical Statistics—Nonparametric Statistics (4)

Topics covered may include the following: classical rank test, rank correlations, permutation tests, distribution free testing, efficiency, confidence intervals, nonparametric regression and density estimation, resampling techniques (bootstrap, jackknife, etc.) and cross validations. Prior enrollment in MATH 109 is highly recommended. ** Prerequisites:** MATH 181B or consent of instructor.

MATH 181D. Statistical Learning (4)

Statistical learning refers to a set of tools for modeling and understanding complex data sets. It uses developments in optimization, computer science, and in particular machine learning. This encompasses many methods such as dimensionality reduction, sparse representations, variable selection, classification, boosting, bagging, support vector machines, and machine learning. **Prerequisites:**ECE 109 or ECON 120A or MAE 108 or MATH 181A or MATH 183 or MATH 186 or MATH 189. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 181E. Mathematical Statistics—Time Series (4)

Analysis of trends and seasonal effects, autoregressive and moving averages models, forecasting, informal introduction to spectral analysis. ** Prerequisites:** MATH 181B or consent of instructor.

MATH 181F. Sampling Surveys and Experimental Design (4)

Design of sampling surveys: simple, stratified, systematic, cluster, network surveys. Sources of bias in surveys. Estimators and confidence intervals based on unequal probability sampling. Design and analysis of experiments: block, factorial, crossover, matched-pairs designs. Analysis of variance, re-randomization, and multiple comparisons. **Prerequisites:** ECE 109 or ECON 120A or MAE 108 or MATH 11 or MATH 181A or MATH 183 or MATH 186 or MATH 189. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 182. Hidden Data in Random Matrices (4)

Rigorous treatment of principal component analysis, one of the most effective methods in finding signals amidst the noise of large data arrays. Topics include singular value decomposition for matrices, maximal likelihood estimation, least squares methods, unbiased estimators, random matrices, Wigner’s semicircle law, Markchenko-Pastur laws, universality of eigenvalue statistics, outliers, the BBP transition, applications to community detection, and stochastic block model. Students will not receive credit for both MATH 182 and DSC 155. Completion of MATH 102 is encouraged but not required. **Prerequisites:** MATH 180A, and MATH 18 or MATH 31AH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 183. Statistical Methods (4)

Introduction to probability. Discrete and continuous random variables–binomial, Poisson and Gaussian distributions. Central limit theorem. Data analysis and inferential statistics: graphical techniques, confidence intervals, hypothesis tests, curve fitting. (Credit not offered for MATH 183 if ECON 120A, ECE 109, MAE 108, MATH 181A, or MATH 186 previously or concurrently taken. Two units of credit offered for MATH 183 if MATH 180A taken previously or concurrently.) ** Prerequisites:**MATH 20C or MATH 31BH, or consent of instructor.

MATH 184. Enumerative Combinatorics (4)

Introduction to the theory and applications of combinatorics. Enumeration of combinatorial structures (permutations, integer partitions, set partitions). Bijections, inclusion-exclusion, ordinary and exponential generating functions. Renumbered from MATH 184A; credit not offered for MATH 184 if MATH 184A if previously taken. Credit not offered for MATH 184 if MATH 188 previously taken. If MATH 184 and MATH 188 are concurrently taken, credit only offered for MATH 188. ** Prerequisites:** MATH 31CH or MATH 109. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 185. Introduction to Computational Statistics (4)

Statistical analysis of data by means of package programs. Regression, analysis of variance, discriminant analysis, principal components, Monte Carlo simulation, and graphical methods. Emphasis will be on understanding the connections between statistical theory, numerical results, and analysis of real data. Recommended preparation: exposure to computer programming (such as CSE 5A, CSE 7, or ECE 15) highly recommended.** Prerequisites:**MATH 181A, or ECON 120B, and either MATH 18 or MATH 20F or MATH 31AH, and MATH 20C or MATH 31BH. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 186. Probability and Statistics for Bioinformatics (4)

This course will cover discrete and random variables, data analysis and inferential statistics, likelihood estimators and scoring matrices with applications to biological problems. Introduction to Binomial, Poisson, and Gaussian distributions, central limit theorem, applications to sequence and functional analysis of genomes and genetic epidemiology. (Credit not offered for MATH 186 if ECON 120A, ECE 109, MAE 108, MATH 181A, or MATH 183 previously or concurrently. Two units of credit offered for MATH 186 if MATH 180A taken previously or concurrently.) ** Prerequisites:** MATH 20C or MATH 31BH, or consent of instructor.

MATH 187A. Introduction to Cryptography (4)

An introduction to the basic concepts and techniques of modern cryptography. Classical cryptanalysis. Probabilistic models of plaintext. Monalphabetic and polyalphabetic substitution. The one-time system. Caesar-Vigenere-Playfair-Hill substitutions. The Enigma. Modern-day developments. The Data Encryption Standard. Public key systems. Security aspects of computer networks. Data protection. Electronic mail. Recommended preparation: basic programming experience. Renumbered from MATH 187. Students may not receive credit for both MATH 187A and MATH 187. ** Prerequisites:** MATH 10A or MATH 20A. Students who have not completed listed prerequisite may enroll with consent of instructor.

MATH 187B. Mathematics of Modern Cryptography (4)

The object of this course is to study modern public key cryptographic systems and cryptanalysis (e.g., RSA, Diffie-Hellman, elliptic curve cryptography, lattice-based cryptography, homomorphic encryption) and the mathematics behind them. We also explore other applications of these computational techniques (e.g., integer factorization and attacks on RSA). Recommended preparation: Familiarity with Python and/or mathematical software (especially SAGE) would be helpful, but it is not required. ** Prerequisites:** MATH 187 or MATH 187A and MATH 18 or MATH 31AH or MATH 20F. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 188. Algebraic Combinatorics (4)

A rigorous introduction to algebraic combinatorics. Basic enumeration and generating functions. Enumeration involving group actions: Polya theory. Posets and Sperner property. q-analogs and unimodality. Partitions and tableaux. Credit not offered for MATH 188 if MATH 184 or MATH 184A previously taken. If MATH 184 and MATH 188 are concurrently taken, credit only offered for MATH 188. **Prerequisites:** MATH 31CH or MATH 109 and MATH 18 or MATH 31AH and MATH 100A or 103A. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 189. Exploratory Data Analysis and Inference (4)

An introduction to various quantitative methods and statistical techniques for analyzing data—in particular big data. Quick review of probability continuing to topics of how to process, analyze, and visualize data using statistical language R. Further topics include basic inference, sampling, hypothesis testing, bootstrap methods, and regression and diagnostics. Offers conceptual explanation of techniques, along with opportunities to examine, implement, and practice them in real and simulated data. ** Prerequisites:**MATH 18 or MATH 20F or MATH 31AH, and MATH 20C and one of BENG 134, CSE 103, ECE 109, ECON 120A, MAE 108, MATH 180A, MATH 183, MATH 186, or SE 125. Students who have not completed listed prerequisites may enroll with consent of instructor.

MATH 190A. Foundations of Topology I (4)

An introduction to point set topology: topological spaces, subspace topologies, product topologies, quotient topologies, continuous maps and homeomorphisms, metric spaces, connectedness, compactness, basic separation, and countability axioms. Examples. Instructor may choose further topics such as Urysohn’s lemma, Urysohn’s metrization theorem. Formerly MATH 190. Students may not receive credit for MATH 190A and MATH 190.*Prerequisites:* MATH 31CH or MATH 140A or MATH 142A. Students who have not completed prerequisites may enroll with consent of instructor.

MATH 190B. Foundations of Topology II (4)

An introduction to the fundamental group: homotopy and path homotopy, homotopy equivalence, basic calculations of fundamental groups, fundamental group of the circle and applications (for instance to retractions and fixed-point theorems), van Kampen’s theorem, covering spaces, universal covers. Examples of all of the above. Instructor may choose further topics such as deck transformations and the Galois correspondence, basic homology, compact surfaces. **Prerequisites:**MATH 190A. Students who have not completed the listed prerequisite may enroll with consent of instructor.

MATH 191. Topics in Topology (4)

Topics to be chosen by the instructor from the fields of differential algebraic, geometric, and general topology. ** Prerequisites:** MATH 190 or consent of instructor.

MATH 193A. Actuarial Mathematics I (4)

Probabilistic Foundations of Insurance. Short-term risk models. Survival distributions and life tables. Introduction to life insurance. ** Prerequisites:** MATH 180A or MATH 183, or consent of instructor.

MATH 193B. Actuarial Mathematics II (4)

Life Insurance and Annuities. Analysis of premiums and premium reserves. Introduction to multiple life functions and decrement models as time permits. ** Prerequisites:** MATH 193A or consent of instructor.

MATH 194. The Mathematics of Finance (4)

Introduction to the mathematics of financial models. Basic probabilistic models and associated mathematical machinery will be discussed, with emphasis on discrete time models. Concepts covered will include conditional expectation, martingales, optimal stopping, arbitrage pricing, hedging, European and American options. ** Prerequisites:**MATH 20D, and either MATH 18 or MATH 20F or MATH 31AH, and MATH 180A. Students who have not completed listed prerequisites may enroll with consent of instructor. Students completing ECON 120A instead of MATH 180A must obtain consent of instructor to enroll.

MATH 195. Introduction to Teaching in Mathematics (4)

Students will be responsible for and teach a class section of a lower-division mathematics course. They will also attend a weekly meeting on teaching methods. (Does not count toward a minor or major.) ** Prerequisites:** consent of instructor.

MATH 196. Student Colloquium (1)

A variety of topics and current research results in mathematics will be presented by guest lecturers and students under faculty direction. May be taken for P/NP grade only. ** Prerequisites:** upper-division status.

MATH 197. Mathematics Internship (2 or 4)

An enrichment program which provides work experience with public/private sector employers. Subject to the availability of positions, students will work in a local company under the supervision of a faculty member and site supervisor. Units may not be applied toward major graduation requirements. ** Prerequisites:** completion of ninety units, two upper-division mathematics courses, an overall 2.5 UC San Diego GPA, consent of mathematics faculty coordinator, and submission of written contract. Department stamp required.

MATH 199. Independent Study for Undergraduates (2 or 4)

Independent reading in advanced mathematics by individual students. Three periods. (P/NP grades only.) ** Prerequisites:** permission of department.

MATH 199H. Honors Thesis Research for Undergraduates (2–4)

Honors thesis research for seniors participating in the Honors Program. Research is conducted under the supervision of a mathematics faculty member. ** Prerequisites:** admission to the Honors Program in mathematics, department stamp.

### Graduate

MATH 200A-B-C. Algebra (4-4-4)

Group actions, factor groups, polynomial rings, linear algebra, rational and Jordan canonical forms, unitary and Hermitian matrices, Sylow theorems, finitely generated abelian groups, unique factorization, Galois theory, solvability by radicals, Hilbert Basis Theorem, Hilbert Nullstellensatz, Jacobson radical, semisimple Artinian rings. ** Prerequisites:** consent of instructor.

MATH 201A. Basic Topics in Algebra I (4)

Recommended for all students specializing in algebra. Basic topics include categorical algebra, commutative algebra, group representations, homological algebra, nonassociative algebra, ring theory. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:**MATH 200C. Students who have not taken MATH 200C may enroll with consent of instructor.

MATH 202A. Applied Algebra I (4)

Introduction to algebra from a computational perspective. Groups, rings, linear algebra, rational and Jordan forms, unitary and Hermitian matrices, matrix decompositions, perturbation of eigenvalues, group representations, symmetric functions, fast Fourier transform, commutative algebra, Grobner basis, finite fields. ** Prerequisites:** graduate standing or consent of instructor.

MATH 202B. Applied Algebra II (4)

Second course in algebra from a computational perspective. Groups, rings, linear algebra, rational and Jordan forms, unitary and Hermitian matrices, matrix decompositions, perturbation of eigenvalues, group representations, symmetric functions, fast Fourier transform, commutative algebra, Grobner basis, finite fields. ** Prerequisites:** MATH 202A or consent of instructor.

MATH 202C. Applied Algebra III (4)

Third course in algebra from a computational perspective. Groups, rings, linear algebra, rational and Jordan forms, unitary and Hermitian matrices, matrix decompositions, perturbation of eigenvalues, group representations, symmetric functions, fast Fourier transform, commutative algebra, Grobner basis, finite fields. ** Prerequisites:** MATH 202B or consent of instructor.

MATH 203A. Algebraic Geometry I (4)

Introduction to algebraic geometry. Topics chosen from: varieties and their properties, sheaves and schemes and their properties. May be taken for credit up to three times. ** Prerequisites:** MATH 200C. Students who have not taken MATH 200C may enroll with consent of instructor.

MATH 203B. Algebraic Geometry II (4)

Second course in algebraic geometry. Continued exploration of varieties, sheaves and schemes, divisors and linear systems, differentials, cohomology. May be taken for credit up to three times. ** Prerequisites:** MATH 203A. Students who have not taken MATH 203A may enroll with consent of instructor.

MATH 203C. Algebraic Geometry III (4)

Third course in algebraic geometry. Continued exploration of varieties, sheaves and schemes, divisors and linear systems, differentials, cohomology, curves, and surfaces. May be taken for credit up to three times. ** Prerequisites:** MATH 203B. Students who have not taken MATH 203B may enroll with consent of instructor.

MATH 204A. Number Theory I (4)

First course in graduate-level number theory. Local fields: valuations and metrics on fields; discrete valuation rings and Dedekind domains; completions; ramification theory; main statements of local class field theory. ** Prerequisites:** MATH 200C. Students who have not taken MATH 200C may enroll with consent of instructor.

MATH 204B. Number Theory II (4)

Second course in graduate-level number theory. Global fields: arithmetic properties and relation to local fields; ideal class groups; groups of units; ramification theory; adèles and idèles; main statements of global class field theory. ** Prerequisites:** MATH 204A. Students who have not taken MATH 204A may enroll with consent of instructor.

MATH 204C. Number Theory III (4)

Third course in graduate-level number theory. Zeta and L-functions; Dedekind zeta functions; Artin L-functions; the class-number formula and generalizations; density theorems. ** Prerequisites:** MATH 204B. Students who have not taken MATH 204B may enroll with consent of instructor.

MATH 205. Topics in Number Theory (4)

Topics in algebraic and analytic number theory, such as: L-functions, sieve methods, modular forms, class field theory, p-adic L-functions and Iwasawa theory, elliptic curves and higher dimensional abelian varieties, Galois representations and the Langlands program, p-adic cohomology theories, Berkovich spaces, etc. May be taken for credit nine times. ** Prerequisites:** graduate standing.

MATH 206A. Topics in Algebraic Geometry (4)

Introduction to varied topics in algebraic geometry. Topics will be drawn from current research and may include Hodge theory, higher dimensional geometry, moduli of vector bundles, abelian varieties, deformation theory, intersection theory. Nongraduate students may enroll with consent of instructor. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:**graduate standing.

MATH 206B. Further Topics in Algebraic Geometry (4)

Continued development of a topic in algebraic geometry. Topics will be drawn from current research and may include Hodge theory, higher dimensional geometry, moduli of vector bundles, abelian varieties, deformation theory, intersection theory. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:**MATH 206A. Students who have not completed MATH 206A may enroll with consent of instructor.

MATH 207A. Topics in Algebra (4)

Introduction to varied topics in algebra. In recent years, topics have included number theory, commutative algebra, noncommutative rings, homological algebra, and Lie groups. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:**graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 208. Seminar in Algebraic Geometry (1)

Various topics in algebraic geometry. May be taken for credit nine times. **Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor. (S/U grade only.)

MATH 209. Seminar in Number Theory (1)

Various topics in number theory. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 210A. Mathematical Methods in Physics and Engineering (4)

Complex variables with applications. Analytic functions, Cauchy’s theorem, Taylor and Laurent series, residue theorem and contour integration techniques, analytic continuation, argument principle, conformal mapping, potential theory, asymptotic expansions, method of steepest descent. ** Prerequisites:** MATH 20D-E-F, 140A/142A, or consent of instructor.

MATH 210B. Mathematical Methods in Physics and Engineering (4)

Linear algebra and functional analysis. Vector spaces, orthonormal bases, linear operators and matrices, eigenvalues and diagonalization, least squares approximation, infinite-dimensional spaces, completeness, integral equations, spectral theory, Green’s functions, distributions, Fourier transform. ** Prerequisites:** MATH 210A or consent of instructor.

MATH 210C. Mathematical Methods in Physics and Engineering (4)

Calculus of variations: Euler-Lagrange equations, Noether’s theorem. Fourier analysis of functions and distributions in several variables. Partial differential equations: Laplace, wave, and heat equations; fundamental solutions (Green’s functions); well-posed problems. ** Prerequisites:** MATH 210B or consent of instructor. (S)

MATH 211. Seminar in Algebra (1)

Various topics in algebra. **Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor. May be taken for credit nine times. (S/U grades only.)

MATH 212A. Introduction to Mathematical Biology I (4)

Part one of a two-course introduction to the use of mathematical theory and techniques in analyzing biological problems. Topics include differential equations, dynamical systems, and probability theory applied to a selection of biological problems from population dynamics, biochemical reactions, biological oscillators, gene regulation, molecular interactions, and cellular function. May be coscheduled with MATH 112A. Recommended preparation: Probability Theory and Differential Equations. *Prerequisites:*graduate standing.

MATH 212B. Introduction to Mathematical Biology II (4)

Part two of a two-course introduction to the use of mathematical theory and techniques in analyzing biological problems. Topics include partial differential equations and stochastic processes applied to a selection of biological problems, especially those involving spatial movement such as molecular diffusion, bacterial chemotaxis, tumor growth, and biological patterns. May be coscheduled with MATH 112B. Recommended preparation: Probability Theory and Stochastic Processes. *Prerequisites:*MATH 212A and graduate standing.

MATH 214. Introduction to Computational Stochastics (4)

Topics include random number generators, variance reduction, Monte Carlo (including Markov Chain Monte Carlo) simulation, and numerical methods for stochastic differential equations. Methods will be illustrated on applications in biology, physics, and finance. May be coscheduled with MATH 114. Recommended preparation: Probability Theory and basic computer programming. *Prerequisites:* graduate standing.

MATH 217. Topics in Applied Mathematics (4)

In recent years, topics have included applied complex analysis, special functions, and asymptotic methods. May be repeated for credit with consent of adviser as topics vary.** Prerequisites:**graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 218. Seminar in Mathematics of Biological Systems (1)

Various topics in the mathematics of biological systems. May be taken for credit nine times. **Prerequisites:** graduate standing. (S/U grades only.)

MATH 220A-B-C. Complex Analysis (4-4-4)

Complex numbers and functions. Cauchy theorem and its applications, calculus of residues, expansions of analytic functions, analytic continuation, conformal mapping and Riemann mapping theorem, harmonic functions. Dirichlet principle, Riemann surfaces. ** Prerequisites:** MATH 140A-B or consent of instructor.

MATH 221A. Topics in Several Complex Variables (4)

Introduction to varied topics in several complex variables. In recent years, topics have included formal and convergent power series, Weierstrass preparation theorem, Cartan-Ruckert theorem, analytic sets, mapping theorems, domains of holomorphy, proper holomorphic mappings, complex manifolds and modifications. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:** MATH 200A and 220C. Students who have not completed MATH 200A and 220C may enroll with consent of instructor.

MATH 221B. Further Topics in Several Complex Variables (4)

Continued development of a topic in several complex variables. Topics include formal and convergent power series, Weierstrass preparation theorem, Cartan-Ruckert theorem, analytic sets, mapping theorems, domains of holomorphy, proper holomorphic mappings, complex manifolds and modifications. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:**MATH 221A. Students who have not completed MATH 221A may enroll with consent of instructor.

MATH 231A-B-C. Partial Differential Equations (4-4-4)

Existence and uniqueness theorems. Cauchy-Kowalewski theorem, first order systems. Hamilton-Jacobi theory, initial value problems for hyperbolic and parabolic systems, boundary value problems for elliptic systems. Green’s function, eigenvalue problems, perturbation theory. ** Prerequisites:** MATH 210A-B or 240A-B-C or consent of instructor.

MATH 237A. Topics in Differential Equations (4)

Introduction to varied topics in differential equations. In recent years, topics have included Riemannian geometry, Ricci flow, and geometric evolution. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 237B. Further Topics in Differential Equations (4)

Continued development of a topic in differential equations. Topics include Riemannian geometry, Ricci flow, and geometric evolution. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:** MATH 237A. Students who have not completed MATH 237A may enroll with consent of instructor.

MATH 240A-B-C. Real Analysis (4-4-4)

Lebesgue integral and Lebesgue measure, Fubini theorems, functions of bounded variations, Stieltjes integral, derivatives and indefinite integrals, the spaces L and C, equi-continuous families, continuous linear functionals general measures and integrations. ** Prerequisites:** MATH 140A-B-C.

MATH 241A-B. Functional Analysis (4-4)

Metric spaces and contraction mapping theorem; closed graph theorem; uniform boundedness principle; Hahn-Banach theorem; representation of continuous linear functionals; conjugate space, weak topologies; extreme points; Krein-Milman theorem; fixed-point theorems; Riesz convexity theorem; Banach algebras. ** Prerequisites:** Math 240A-B-C or consent of instructor.

MATH 242. Topics in Fourier Analysis (4)

In recent years, topics have included Fourier analysis in Euclidean spaces, groups, and symmetric spaces. May be repeated for credit with consent of adviser as topics vary. ** Prerequisites:** MATH 240C, students who have not completed MATH 240C may enroll with consent of instructor.

MATH 243. Seminar in Functional Analysis (1)

Various topics in functional analysis. May be taken for credit nine times. **Prerequisites:** graduate standing or consent of instructor. (S/U grades only.)

MATH 245A. Convex Analysis and Optimization I (4)

Convex sets and functions, convex and affine hulls, relative interior, closure, and continuity, recession and existence of optimal solutions, saddle point and min-max theory, subgradients and subdifferentials. Recommended preparation: course work in linear algebra and real analysis. ** Prerequisites:** graduate standing.

MATH 245B. Convex Analysis and Optimization II (4)

Optimality conditions, strong duality and the primal function, conjugate functions, Fenchel duality theorems, dual derivatives and subgradients, subgradient methods, cutting plane methods. ** Prerequisites:** MATH 245A or consent of instructor.

MATH 245C. Convex Analysis and Optimization III (4)

Convex optimization problems, linear matrix inequalities, second-order cone programming, semidefinite programming, sum of squares of polynomials, positive polynomials, distance geometry. ** Prerequisites:** MATH 245B or consent of instructor.

MATH 247A. Topics in Real Analysis (4)

Introduction to varied topics in real analysis. In recent years, topics have included Fourier analysis, distribution theory, martingale theory, operator theory. May be taken for credit six times with consent of adviser. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 247B. Further Topics in Real Analysis (4)

Continued development of a topic in real analysis. Topics include Fourier analysis, distribution theory, martingale theory, operator theory. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:** MATH 247A. Students who have not completed MATH 247A may enroll with consent of instructor.

MATH 248. Seminar in Real Analysis (1)

Various topics in real analysis. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 250A-B-C. Differential Geometry (4-4-4)

Differential manifolds, Sard theorem, tensor bundles, Lie derivatives, DeRham theorem, connections, geodesics, Riemannian metrics, curvature tensor and sectional curvature, completeness, characteristic classes. Differential manifolds immersed in Euclidean space. ** Prerequisites:** consent of instructor.

MATH 251A-B-C. Lie Groups (4-4-4)

Lie groups, Lie algebras, exponential map, subgroup subalgebra correspondence, adjoint group, universal enveloping algebra. Structure theory of semisimple Lie groups, global decompositions, Weyl group. Geometry and analysis on symmetric spaces. ** Prerequisites:** MATH 200 and 250 or consent of instructor.

MATH 256. Seminar in Lie Groups and Lie Algebras (1)

Various topics in Lie groups and Lie algebras, including structure theory, representation theory, and applications. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 257A. Topics in Differential Geometry (4)

Introduction to varied topics in differential geometry. In recent years, topics have included Morse theory and general relativity. May be taken for credit six times with consent of adviser. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 257B. Further Topics in Differential Geometry (4)

Continued development of a topic in differential geometry. Topics include Morse theory and general relativity. May be taken for credit three times with consent of adviser. ** Prerequisites:** MATH 257A. Students who have not completed MATH 257A may enroll with consent of instructor.

MATH 258. Seminar in Differential Geometry (1)

Various topics in differential geometry. May be taken for credit nine times. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 259A-B-C. Geometrical Physics (4-4-4)

Manifolds, differential forms, homology, deRham’s theorem. Riemannian geometry, harmonic forms. Lie groups and algebras, connections in bundles, homotopy sequence of a bundle, Chern classes. Applications selected from Hamiltonian and continuum mechanics, electromagnetism, thermodynamics, special and general relativity, Yang-Mills fields. ** Prerequisites:** graduate standing in mathematics, physics, or engineering, or consent of instructor.

MATH 260A. Mathematical Logic I (4)

Propositional calculus and first-order logic. Theorem proving, Model theory, soundness, completeness, and compactness, Herbrand’s theorem, Skolem-Lowenheim theorems, Craig interpolation. ** Prerequisites:** graduate standing or consent of instructor.

MATH 260B. Mathematical Logic II (4)

Theory of computation and recursive function theory, Church’s thesis, computability and undecidability. Feasible computability and complexity. Peano arithmetic and the incompleteness theorems, nonstandard models. ** Prerequisites:** MATH 260A or consent of instructor.

MATH 261A. Probabilistic Combinatorics and Algorithms (4)

Introduction to the probabilistic method. Combinatorial applications of the linearity of expectation, second moment method, Markov, Chebyschev, and Azuma inequalities, and the local limit lemma. Introduction to the theory of random graphs. ** Prerequisites:** graduate standing or consent of instructor.

MATH 261B. Probabilistic Combinatorics and Algorithms II (4)

Introduction to probabilistic algorithms. Game theoretic techniques. Applications of the probabilistic method to algorithm analysis. Markov Chains and Random walks. Applications to approximation algorithms, distributed algorithms, online and parallel algorithms. MATH 261A must be taken before MATH 261B. ** Prerequisites:** MATH 261A.

MATH 261C. Probabilistic Combinatorics and Algorithms III (4)

Advanced topics in the probabilistic combinatorics and probabilistic algorithms. Random graphs. Spectral Methods. Network algorithms and optimization. Statistical learning. MATH 261B must be taken before MATH 261C. ** Prerequisites:** MATH 261B.

MATH 262A. Topics in Combinatorial Mathematics (4)

Introduction to varied topics in combinatorial mathematics. In recent years topics have included problems of enumeration, existence, construction, and optimization with regard to finite sets. Recommended preparation: some familiarity with computer programming desirable but not required. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:**graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 262B. Further Topics in Combinatorial Mathematics (4)

Continued development of a topic in combinatorial mathematics. Topics include problems of enumeration, existence, construction, and optimization with regard to finite sets. Recommended preparation: some familiarity with computer programming desirable but not required. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:** MATH 262A. Students who have not completed MATH 262A may enroll with consent of instructor.

MATH 264A-B-C. Combinatorics (4-4-4)

Topics from partially ordered sets, Mobius functions, simplicial complexes and shell ability. Enumeration, formal power series and formal languages, generating functions, partitions. Lagrange inversion, exponential structures, combinatorial species. Finite operator methods, q-analogues, Polya theory, Ramsey theory. Representation theory of the symmetric group, symmetric functions and operations with Schur functions.

MATH 267A. Topics in Mathematical Logic (4)

Introduction to varied topics in mathematical logic. Topics chosen from recursion theory, model theory, and set theory. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:** graduate standing or consent of instructor. Nongraduate students may enroll with consent of instructor.

MATH 267B. Further Topics in Mathematical Logic (4)

Continued development of a topic in mathematical logic. Topics chosen from recursion theory, model theory, and set theory. May be taken for credit three times with consent of adviser as topics vary.** Prerequisites:**MATH 267A or consent of instructor. Students who have not completed MATH 267A may enroll with consent of instructor.

MATH 268. Seminar in Logic (1)

Various topics in logic. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 269. Seminar in Combinatorics (1)

Various topics in combinatorics. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 270A. Numerical Linear Algebra (4)

Error analysis of the numerical solution of linear equations and least squares problems for the full rank and rank deficient cases. Error analysis of numerical methods for eigenvalue problems and singular value problems. Iterative methods for large sparse systems of linear equations. ** Prerequisites:** graduate standing or consent of instructor.

MATH 270B. Numerical Approximation and Nonlinear Equations (4)

Iterative methods for nonlinear systems of equations, Newton’s method. Unconstrained and constrained optimization. The Weierstrass theorem, best uniform approximation, least-squares approximation, orthogonal polynomials. Polynomial interpolation, piecewise polynomial interpolation, piecewise uniform approximation. Numerical differentiation: divided differences, degree of precision. Numerical quadrature: interpolature quadrature, Richardson extrapolation, Romberg Integration, Gaussian quadrature, singular integrals, adaptive quadrature. ** Prerequisites:** MATH 270A or consent of instructor.

MATH 270C. Numerical Ordinary Differential Equations (4)

Initial value problems (IVP) and boundary value problems (BVP) in ordinary differential equations. Linear methods for IVP: one and multistep methods, local truncation error, stability, convergence, global error accumulation. Runge-Kutta (RK) Methods for IVP: RK methods, predictor-corrector methods, stiff systems, error indicators, adaptive time-stepping. Finite difference, finite volume, collocation, spectral, and finite element methods for BVP; a priori and a posteriori error analysis, stability, convergence, adaptivity. ** Prerequisites:** MATH 270B or consent of instructor.

MATH 271A-B-C. Numerical Optimization (4-4-4)

Formulation and analysis of algorithms for constrained optimization. Optimality conditions; linear and quadratic programming; interior methods; penalty and barrier function methods; sequential quadratic programming methods. ** Prerequisites:** consent of instructor.

MATH 272A. Numerical Partial Differential Equations I (4)

Survey of discretization techniques for elliptic partial differential equations, including finite difference, finite element and finite volume methods. Lax-Milgram Theorem and LBB stability. A priori error estimates. Mixed methods. Convection-diffusion equations. Systems of elliptic PDEs. ** Prerequisites:** graduate standing or consent of instructor.

MATH 272B. Numerical Partial Differential Equations II (4)

Survey of solution techniques for partial differential equations. Basic iterative methods. Preconditioned conjugate gradients. Multigrid methods. Hierarchical basis methods. Domain decomposition. Nonlinear PDEs. Sparse direct methods. ** Prerequisites:** MATH 272A or consent of instructor.

MATH 272C. Numerical Partial Differential Equations III (4)

Time dependent (parabolic and hyperbolic) PDEs. Method of lines. Stiff systems of ODEs. Space-time finite element methods. Adaptive meshing algorithms. A posteriori error estimates. ** Prerequisites:** MATH 272B or consent of instructor.

MATH 273A. Advanced Techniques in Computational Mathematics I (4)

Models of physical systems, calculus of variations, principle of least action. Discretization techniques for variational problems, geometric integrators, advanced techniques in numerical discretization. Project-oriented; projects designed around problems of current interest in science, mathematics, and engineering. ** Prerequisites:** graduate standing or consent of instructor.

MATH 273B. Advanced Techniques in Computational Mathematics II (4)

Nonlinear functional analysis for numerical treatment of nonlinear PDE. Numerical continuation methods, pseudo-arclength continuation, gradient flow techniques, and other advanced techniques in computational nonlinear PDE. Project-oriented; projects designed around problems of current interest in science, mathematics, and engineering. ** Prerequisites:** MATH 273A or consent of instructor.

MATH 273C. Advanced Techniques in Computational Mathematics III (4)

Adaptive numerical methods for capturing all scales in one model, multiscale and multiphysics modeling frameworks, and other advanced techniques in computational multiscale/multiphysics modeling. Project-oriented; projects designed around problems of current interest in science, mathematics, and engineering. ** Prerequisites:** MATH 273B or consent of instructor.

MATH 274. Numerical Methods for Physical Modeling (4)

(Conjoined with MATH 174.) Floating point arithmetic, direct and iterative solution of linear equations, iterative solution of nonlinear equations, optimization, approximation theory, interpolation, quadrature, numerical methods for initial and boundary value problems in ordinary differential equations. Students may not receive credit for both MATH 174 and PHYS 105, AMES 153 or 154. (Students may not receive credit for MATH 174 if MATH 170A, B, or C has already been taken.) Graduate students will complete an additional assignment/exam. ** Prerequisites:** MATH 20D or 21D, and either MATH 20F or MATH 31AH, or consent of instructor.

MATH 275. Numerical Methods for Partial Differential Equations (4)

(Conjoined with MATH 175.) Mathematical background for working with partial differential equations. Survey of finite difference, finite element, and other numerical methods for the solution of elliptic, parabolic, and hyperbolic partial differential equations. (Formerly MATH 172; students may not receive credit for MATH 175/275 and MATH 172.) Graduate students will do an extra paper, project, or presentation, per instructor. ** Prerequisites:** MATH 174 or MATH 274 or consent of instructor.

MATH 276. Numerical Analysis in Multiscale Biology (4)

(Cross-listed with BENG 276/CHEM 276.) Introduces mathematical tools to simulate biological processes at multiple scales. Numerical methods for ordinary and partial differential equations (deterministic and stochastic), and methods for parallel computing and visualization. Hands-on use of computers emphasized, students will apply numerical methods in individual projects. ** Prerequisites:** consent of instructor.

MATH 277A. Topics in Computational and Applied Mathematics (4)

Introduction to varied topics in computational and applied mathematics. In recent years, topics have included applied functional analysis and approximation theory; numerical treatment of nonlinear partial differential equations; and geometric numerical integration for differential equations. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 278A. Seminar in Computational and Applied Mathematics (1)

Various topics in computational and applied mathematics. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor. (S/U grade only.)

MATH 278B. Seminar in Mathematics of Information, Data, and Signals (1)

Various topics in the mathematics of information, data, and signals. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 278C. Seminar in Optimization (1)

Various topics in optimization and applications. May be taken for credit nine times. ** Prerequisites:** graduate standing. (S/U grade only.)

MATH 279. Projects in Computational and Applied Mathematics (4)

(Conjoined with MATH 179.) Mathematical models of physical systems arising in science and engineering, good models and well-posedness, numerical and other approximation techniques, solution algorithms for linear and nonlinear approximation problems, scientific visualizations, scientific software design and engineering, project-oriented. Graduate students will do an extra paper, project, or presentation per instructor. ** Prerequisites:** MATH 174, or MATH 274, or consent of instructor.

MATH 280A. Probability Theory I (4)

This is the first course in a three-course sequence in probability theory. Topics covered in the sequence include the measure-theoretic foundations of probability theory, independence, the Law of Large Numbers, convergence in distribution, the Central Limit Theorem, conditional expectation, martingales, Markov processes, and Brownian motion. Recommended preparation: completion of real analysis equivalent to MATH 140A-B strongly recommended. ** Prerequisites:**graduate standing.

MATH 280B. Probability Theory II (4)

This is the second course in a three-course sequence in probability theory. Topics covered in the sequence include the measure-theoretic foundations of probability theory, independence, the Law of Large Numbers, convergence in distribution, the Central Limit Theorem, conditional expectation, martingales, Markov processes, and Brownian motion. ** Prerequisites:**MATH 280A.

MATH 280C. Probability Theory III (4)

This is the third course in a three-course sequence in probability theory. Topics covered in the sequence include the measure-theoretic foundations of probability theory, independence, the Law of Large Numbers, convergence in distribution, the Central Limit Theorem, conditional expectation, martingales, Markov processes, and Brownian motion. ** Prerequisites:** MATH 280B.

MATH 281A. Mathematical Statistics (4)

Statistical models, sufficiency, efficiency, optimal estimation, least squares and maximum likelihood, large sample theory. ** Prerequisites:** advanced calculus and basic probability theory or consent of instructor.

MATH 281B. Mathematical Statistics (4)

Hypothesis testing and confidence intervals, one-sample and two-sample problems. Bayes theory, statistical decision theory, linear models and regression. ** Prerequisites:** advanced calculus and basic probability theory or consent of instructor.

MATH 281C. Mathematical Statistics (4)

Nonparametrics: tests, regression, density estimation, bootstrap and jackknife. Introduction to statistical computing using S plus. ** Prerequisites:** advanced calculus and basic probability theory or consent of instructor.

MATH 282A. Applied Statistics I (4)

General theory of linear models with applications to regression analysis. Ordinary and generalized least squares estimators and their properties. Hypothesis testing, including analysis of variance, and confidence intervals. Completion of courses in linear algebra and basic statistics are recommended prior to enrollment. ** Prerequisites:** graduate standing or consent of instructor. (S/U grades permitted.)

MATH 282B. Applied Statistics II (4)

Diagnostics, outlier detection, robust regression. Variable selection, ridge regression, the lasso. Generalized linear models, including logistic regression. Data analysis using the statistical software R. Students who have not taken MATH 282A may enroll with consent of instructor. ** Prerequisites:**MATH 282A or consent of instructor. (S/U grades permitted.)

MATH 283. Statistical Methods in Bioinformatics (4)

This course will cover material related to the analysis of modern genomic data; sequence analysis, gene expression/functional genomics analysis, and gene mapping/applied population genetics. The course will focus on statistical modeling and inference issues and not on database mining techniques. ** Prerequisites:** one year of calculus, one statistics course or consent of instructor.

MATH 284. Lifetime Data Analysis (4)

Survival analysis is an important tool in many areas of applications including biomedicine, economics, engineering. It deals with the analysis of time to events data with censoring. This course discusses the concepts and theories associated with survival data and censoring, comparing survival distributions, proportional hazards regression, nonparametric tests, competing risk models, and frailty models. The emphasis is on semiparametric inference, and material is drawn from recent literature. Students who have not completed listed prerequisites may enroll with consent of instructor. ** Prerequisites:** MATH 282A or consent of instructor.

MATH 285. Stochastic Processes (4)

Elements of stochastic processes, Markov chains, hidden Markov models, martingales, Brownian motion, Gaussian processes. Recommended preparation: completion of undergraduate probability theory (equivalent to MATH 180A) highly recommended. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 286. Stochastic Differential Equations (4)

Review of continuous martingale theory. Stochastic integration for continuous semimartingales. Existence and uniqueness theory for stochastic differential equations. Strong Markov property. Selected applications. ** Prerequisites:** MATH 280A-B or consent of instructor.

MATH 287A. Time Series Analysis (4)

Discussion of finite parameter schemes in the Gaussian and non-Gaussian context. Estimation for finite parameter schemes. Stationary processes and their spectral representation. Spectral estimation. Students who have not taken MATH 282A may enroll with consent of instructor. ** Prerequisites:** MATH 282A or consent of instructor.

MATH 287B. Multivariate Analysis (4)

Bivariate and more general multivariate normal distribution. Study of tests based on Hotelling’s T2. Principal components, canonical correlations, and factor analysis will be discussed as well as some competing nonparametric methods, such as cluster analysis. Students who have not taken MATH 282A may enroll with consent of instructor. ** Prerequisites:** MATH 282A or consent of instructor.

MATH 287C. Advanced Time Series Analysis (4)

Nonparametric function (spectrum, density, regression) estimation from time series data. Nonlinear time series models (threshold AR, ARCH, GARCH, etc.). Nonparametric forms of ARMA and GARCH. Multivariate time series. Students who have not taken MATH 287A may enroll with consent of instructor. ** Prerequisites:** MATH 287A or consent of instructor.

MATH 287D. Statistical Learning (4)

Topics include regression methods: (penalized) linear regression and kernel smoothing; classification methods: logistic regression and support vector machines; model selection; and mathematical tools and concepts useful for theoretical results such as VC dimension, concentration of measure, and empirical processes. Students who have not taken MATH 282A may enroll with consent of instructor. ** Prerequisites:** MATH 282A or consent of instructor.

MATH 288. Seminar in Probability and Statistics (1)

Various topics in probability and statistics. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 289A. Topics in Probability and Statistics (4)

Introduction to varied topics in probability and statistics. In recent years, topics have included Markov processes, martingale theory, stochastic processes, stationary and Gaussian processes, ergodic theory. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 289B. Further Topics in Probability and Statistics (4)

Continued development of a topic in probability and statistics. Topics include Markov processes, martingale theory, stochastic processes, stationary and Gaussian processes, ergodic theory. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:** MATH 289A. Students who have not completed MATH 289A may enroll with consent of instructor.

MATH 289C. Exploratory Data Analysis and Inference (4)

An introduction to various quantitative methods and statistical techniques for analyzing data—in particular big data. Quick review of probability continuing to topics of how to process, analyze, and visualize data using statistical language R. Further topics include basic inference, sampling, hypothesis testing, bootstrap methods, and regression and diagnostics. Offers conceptual explanation of techniques, along with opportunities to examine, implement, and practice them in real and simulated data. Recommended preparation: familiarity with linear algebra and mathematical statistics highly recommended. ** Prerequisites:** graduate standing.

MATH 290A-B-C. Topology (4-4-4)

Point set topology, including separation axioms, compactness, connectedness. Algebraic topology, including the fundamental group, covering spaces, homology and cohomology. Homotopy or applications to manifolds as time permits. ** Prerequisites:** MATH 100A-B-C and MATH 140A-B-C.

MATH 291A. Topics in Topology (4)

Introduction to varied topics in topology. In recent years topics have included generalized cohomology theory, spectral sequences, K-theory, homotophy theory. May be taken for credit six times with consent of adviser as topics vary. ** Prerequisites:** graduate standing. Nongraduate students may enroll with consent of instructor.

MATH 291B. Further Topics in Topology (4)

Continued development of a topic in topology. Topics include generalized cohomology theory, spectral sequences, K-theory, homotophy theory. May be taken for credit three times with consent of adviser as topics vary. ** Prerequisites:** MATH 291A. Students who have not completed MATH 291A may enroll with consent of instructor.

MATH 292. Seminar in Topology (1)

Various topics in topology. May be taken for credit nine times. ** Prerequisites:** graduate standing or consent of instructor. (S/U grade only.)

MATH 294. The Mathematics of Finance (4)

Introduction to the mathematics of financial models. Hedging, pricing by arbitrage. Discrete and continuous stochastic models. Martingales. Brownian motion, stochastic calculus. Black-Scholes model, adaptations to dividend paying equities, currencies and coupon-paying bonds, interest rate market, foreign exchange models. ** Prerequisites:** MATH 180A (or equivalent probability course) or consent of instructor.

MATH 295. Special Topics in Mathematics (1 to 4)

A variety of topics and current research results in mathematics will be presented by staff members and students under faculty direction.

MATH 296. Graduate Student Colloquium (1)

A variety of advanced topics and current research in mathematics will be presented by department faculty. (S/U grades only.) May be taken for credit six times. ** Prerequisites:** graduate standing.

MATH 297. Mathematics Graduate Research Internship (2–4)

An enrichment program that provides work experience with public/private sector employers and researchers. Under supervision of a faculty adviser, students provide mathematical consultation services. ** Prerequisites:** consent of instructor.

MATH 299. Reading and Research (1 to 12)

Independent study and research for the doctoral dissertation. One to three credits will be given for independent study (reading) and one to nine for research. ** Prerequisites:** consent of instructor. (S/U grades permitted.)

### Teaching of Mathematics

MATH 500. Teaching Assistant Training (2 or 4)

A course in which teaching assistants are aided in learning proper teaching methods through faculty-led discussions, preparation and grading of examinations and other written exercises, academic integrity, and student interactions. Number of units for credit depends on number of hours devoted to teaching assistant duties. May be taken for credit up to nine times for a maximum of thirty-six units. Must have concurrent teaching assistant appointment in mathematics. ** Prerequisites:** consent of adviser. (S/U grades only.)

## 187 ucsd math

This is an introduction to the basic concepts and techniques of cryptography. Topics include but not limited to the following:

- Classicial cryptography such as Ceasar, Vigenere, Rectangular Transposition, Mono-alphabetic Substitution, Playfair, ADFGVX, Vernam, Affine, Hill, etc.
- Elementary probability and statistics: random variables, probability, conditional probability, Chi-square test, etc.
- Intro to information theory: entropy, the Huffman code, and perfect secrecy crypto-systems.
- Elementary number theory: Euclidean algorithm, Chinese remainder theorem, Euler phi-function, quadratic residues, and primality testing.
- Modern cryptography: Diffie-Hellman, RSA, Elliptic Curve cryptography.

**Prerequisites:** Upper-division standing with some programming experience.

**Textbook:** There is no required textbook for this class. We shall mainly use the lecture notes for this class.

**Optional reference text:***An Introduction to Mathematical Cryptography* by Hoffstein, Pipher and Silverman. The electronic version of this book is available at UCSD library website.

### Homework (80% of your course grade)

First and foremost, **late homework will not be accepted and there will be no exception to this rule**. If you fail to submit your homework before the deadline, then you will automatically receive a zero for that assignment. Please do not contact the instruction staff to ask for leniency!

There will be 8 assignments in total. Homework assignments are posted on the class website under the “Assignments” tab, and * due at 10:00pm on the indicated date through Gradescope*. Before the deadline, you may submit as many copies of your homework paper as you would like; however, only the most recent submission will be considered.

*. We strongly encourage that you*

**All problems on homework assignments will be graded for correctness***. Handwritten papers should be legible or your homework may not be graded. The scores and solutions to these problems will be available on Gradescope and TritonED.*

**type your solution**Homework may be done in groups of one to three students. You are free to change group members at any time throughout the quarter. Problems should be solved together, not divided up between partners. Each group only need to submit one copy of their homework. Please remember to indicate the names of all group members in your submission.

### Final Exam (20% of your course grade)

The Final Exam will be held on Friday March 22, 3:00pm-5:59pm, location TBA. **There will be no make up exam! **It is your responsibility to ensure that you do not have a schedule conflict involving the exam. **You must pass the final examination (scoring at least 50%) in order to pass the course**.

You are allowed to bring **one sheet of notes - both sides - and a calculator**. It is important that you have a calculator with you on the exam as the questions are written based on the fact that you have access to a calculator. No other substitution devices are allowed, including cellphone, laptop, tablet, etc. Study guide will also be posted roughly one week prior to the exam date.

As indicated above, your grade will be based on the scores of the homework assignments and the final exam. The letter grade you receive at the end of the course will be based on the following scale:

The final scores may be adjusted to determine the letter grades. However, the letter grade corresponding to a given percentage will never be lower than specified by the above scale.

All graded materials will be posted on Gradescope and their solutions on TritonED. If you find a grading error on any graded material, you must immediately request a regrade through Gradescope. * All regrade issues regarding homework scores must be resolved within one weeks after the score is published*. After that, the score will become final and any late requests will not be considered. Finalized score will then be imported over to TritonED.

Only the grades posted on TritonED will be computed toward your final score percentage. You must keep all of your graded materials and check TritonED frequently to make sure that the grades on your Gradescope pages match those recorded on TritonED. If there is any inconsistency in the recording of your scores, you must * inform the instructor or TA before the end of the 10th week* of the quarter to resolve recording errors. Questions regarding missing or incorrectly recorded scores will not be considered after the last day of instruction.

### Academic Honesty and Attendance Policy

As a student of UC San Diego, you have agreed to abide by the university’s academic honesty policy. Academic integrity violations will be taken seriously and reported immediately. Violation of such policy may result in failing the class, suspension, and even expulsion from the university. Students are expected to attend classes regularly. Cell-phone and all electronic devices must be turned off during lecture time, unless being used for taking note. Further information regarding Academic Integrity policy are available under the "Links" button above. You should make yourself aware of what is and is not acceptable by reading this document. Ignorance of the rules will not excuse you from any violations.

### Announcements (most recent at top):

- 03/06/2019 - HERE is the list of topics for the final exam.
- 01/07/2019 - Welcome to Math 187A. Please see the post on TritonED and confirm your enrollment on Piazza and Gradescope. Also, please check THIS LINK for a tutorial on homework submission. There will be no discussion section during the first week.
**Discussion will start next Monday 01/14.**

- Email: [email protected]
- Office: APM 6436
- Office Hours: Tuesday 12 noon-2pm and Wednesday 2pm-4pm

- Email: [email protected]
- Office: APM 6444
- Office Hours: Mondays & Wednesdays 12PM-2PM

- Email: [email protected]
- Office: APM 6436
- Office Hours: Mondays & Wednesdays, 8AM-10AM

**Lecture:** Monday, Wednesday, Friday 4:00pm - 4:50pm in PETER **108 (starting Friday 1/18)**

**Discussions (all sections meet on Monday): **

- Section A01 (Mirka) : 5:00pm - 5:50pm in WLH 2112
- Section A02 (Mirka): 6:00pm - 6:50pm in WLH 2112
- Section A03 (Meyer): 7:00pm - 7:50pm in WLH 2112
- Section A04 (Meyer): 8:00pm - 8:50pm in WLH 2112
- Section A05 (Grubb): 8:00pm - 8:50pm in APM B402A
- Section A06 (Khillan): 9:00pm - 9:50pm in APM B402A
- Section A07 (Kongsgaard): 5:00pm - 5:50pm in APM 5402
- Section A08 (Kongsgaard): 7:00pm - 7:50pm in APM B402A

**Final Exam:**

- Friday, March 22, 3:00pm - 6:00pm, location TBA

### You will also be interested:

- Herb rolls pioneer woman
- Pomsky tennessee
- Lg new washer 2015
- Vah medoh guide
- Gigabyte bios
- Kids favorite songs dvd
- Pet grooming katy
- Class ring iris

Therefore, taking advantage of the evening of the long-awaited loneliness, the girl decided to devote herself to such a beloved dating. Site. But something wasn't rolling there today.

**1789**1790 1791