MATH 105 and 106 are designed for students whose background and algebraic skills are inadequate for the fast pace of MATH 111. In addition to covering the usual material of beginning calculus, these courses will have an extensive review of algebra and trigonometry. There will be a special emphasis on solving word problems.

MATH 105 starts with a quick review of algebraic manipulations, inequalities, absolute values and straight lines. Then the basic ideas of calculus—limits, derivatives, and integrals—are introduced, but only in the context of polynomial and rational functions. As various applications are studied, the algebraic techniques involved will be reviewed in more detail. When covering related rates and maximum-minimum problems, time will be spent learning how to approach, analyze and solve word problems. Four class meetings per week, one of which is a two-hour group-work day.

Note: While MATH 105 and 106 are sufficient for any course with a MATH 111 requisite, MATH 105 alone is not. However, students who plan to take MATH 121 should consider taking MATH 105 and then MATH 111, rather than MATH 106. Students cannot register for both MATH 105 and CHEM 151 in the same semester.

Fall semester. Professor Alvarado.

MATH 106 is a continuation of MATH 105. Trigonometric, logarithmic and exponential functions will be studied from the point of view of both algebra and calculus. The applications encountered in MATH 105 will reappear in problems involving these new functions. The basic ideas and theorems of calculus will be reviewed in detail, with more attention being paid to rigor.

This course is expected to include both synchronous and asynchronous class sessions and activities, and opportunities for peer engagement.

Requisite: MATH 105. Spring semester. Professor Hews.

Basic concepts of limits, derivatives, anti-derivatives; applications, including max/min problems and related rates; the definite integral, simple applications; trigonometric functions; logarithms and exponential functions. Four class hours per week.

This course is expected to include both synchronous and asynchronous class sessions and activities, and opportunities for peer engagement.

Limited to 30 students per section. Fall and spring semesters. In the fall semester, the intensive section (Section 01) is open only to students listed as eligible on the Mathematics placement list. The intensive section replaces one weekly class hour with a 90-to-120-minute group work day. The Department.

A continuation of MATH 111. Inverse trigonometric and hyperbolic functions; methods of integration, both exact and approximate; applications of integration to volume and arc length; improper integrals; l’Hôpital’s rule; infinite series, power series and the Taylor development; and polar coordinates. Four class hours per week.

In order to foster student engagement in MATH 121, there will be a combination of lively recorded videos, some energetic, many engaging and welcoming office hours, as well as personalized email communication with the Professor.

Requisite: A grade of C or better in MATH 111 or placement into MATH 121 or consent of the Department. Limited to 30 students per section. Fall and spring semesters. The Department.

Mathematical modeling is the process of translating a real world problem into a mathematical expression, analyzing it using mathematical tools and numerical simulations, and then interpreting the results in the context of the original problem. Discussion of basic modeling principles and case studies will be followed by several projects from areas including biology and the social sciences (e.g., flocking and schooling behavior, disease spread in populations, generation of artificial societies). This course has no requisites; projects will be tailored to each student’s level of mathematical preparation. Four class hours per week, with occasional in-class computer labs.

Limited to 24 students. Spring semester. Professor Leise.

Mathematical modeling is used by scientists to understand the dynamics of a system, make predictions and inform policy. It involves an iterative process of translating a real world problem into a mathematical expression, analyzing it using mathematical tools and numerical simulations, and interpreting the results. This course covers systems thinking and the principles of mathematical modeling in the context of environmental problems. Group projects will be centered on current environmental research questions. Contributions to the projects will be tailored to each student’s level of mathematical preparation and interest. Four class hours per week.

Limited to 24 students. This course and Math 140 cannot both be counted towards the Mathematics major. Omitted 2020-21. Professor Hews.

The outcomes of many elections, whether to elect the next United States president or to rank college football teams, can displease many of the voters. How can perfectly fair elections produce results that nobody likes? We will analyze different voting systems, including majority rule, plurality rule, Borda count, and approval voting, and assess a voter’s power to influence the election under each system, for example, by calculating the Banzhaf power index. We will prove Arrow’s Theorem and discuss its implications. After exploring the pitfalls of various voting systems through both theoretical analysis and case studies, we will try to answer some pressing questions: Which voting system best reflects the will of the voters? Which is least susceptible to manipulation? What properties should we seek in a voting system, and how can we best attain them?

Limited to 24 students. Fall semester. Professor Leise.

(Offered as MATH 205, BLST 309 and HIST 209 [US]) This course will look at issues surrounding inequality in K-12 math education. Mathematics has a reputation for being something that either you can do or you can’t: the so-called "geniuses" know all the answers already, whereas for everyone else it is a constant struggle. In addition, math and other STEM fields have traditionally been discouraged as career paths for women and for students from underrepresented groups. At Amherst today, students from those groups are still in the minority in math classes. We’ll ask why this is, whether it can and should be changed, and if so, how.

Our discussions will be guided by some of the following questions: To what extent is math ability an innate talent that you are either born with or not? How and why is variation in accomplishment in mathematics related to race, gender and socio-economic class? What mathematics should we teach in schools and how should those teachers be prepared? What is "math phobia," how does it develop and how can it be treated? How do attitudes towards math in the general public affect student learning?

Limited to 25 students. Admission with consent of the instructor. Omitted 2020-21.

Elementary vector calculus; introduction to partial derivatives; multiple integrals in two and three dimensions; line integrals in the plane; Green’s theorem; the Taylor development and extrema of functions of several variables; implicit function theorems; Jacobians. Four class hours per week.

This course is expected to include both synchronous and asynchronous class sessions and activities, and opportunities for peer engagement.

Requisite: A grade of C or better in MATH 121 or placement into MATH 211 or consent of the Department. Limited to 30 students per section. Fall and spring semesters. The Department.

This course serves as an introduction to mathematical reasoning and pays particular attention to helping students learn how to write proofs. The topics covered may include logic, elementary set theory, functions, relations and equivalence relations, mathematical induction, sequences, and quantifiers. Additional topics may vary from semester to semester. Four class hours per week.

MATH 220 will be online-only, and will involve a variety of online and offline activities, including all-class Zoom meetings, small group sessions, individual office hours and problem sets. Students will be expected to engage fully with the course material, and with each other, both during live video meetings and via online discussion forums. Alternative arrangements will be made for students in time zones that make attending specific meetings difficult, or who have other challenges with doing work for the course online. Students who are on-campus may be able to carry out some of the small group work in-person.

Limited to 25 students. The Department.

This course is an introduction to proofs and abstract mathematical thinking, serving as a bridge from introductory courses such as calculus to more advanced proof-based courses. The principal goal of this course is to help students develop skills for both reading and writing mathematical proofs. Topics covered may include fundamentals of logic, quantifiers, proof techniques, mathematical induction, elementary set theory, equivalence relations, functions, and the notions of countability and uncountability. Some topics in analysis will also be surveyed, such as open and closed sets in the real line, sequences of real numbers, and limits of functions. Additional topics may vary from year to year.

Four class hours per week. MATH 220 and 221 may not both be taken for credit. Limited to 25 students. Omitted 2020-21. Professor Alvarado.

This course is a mathematical treatment of fractal geometry, a field of mathematics partly developed by Benoit Mandelbrot (1924–2010) that continues to be actively researched in the present day. Fractal geometry is a mathematical examination of the concepts of self-similarity, fractals, and chaos, and their applications to the modeling of natural phenomena. In particular, we will develop the iterated function system (IFS) method for describing fractals, examine Julia sets, Mandelbrot sets, and study the concept of fractal dimension, among other things. Through the teaching of these concepts, the course will also lend itself to familiarizing students with some of the formalisms and rigor of mathematical proofs.

Requisite: MATH 211 or consent of the instructor. Limited to 35 students. Omitted 2020-21. Professor Folsom.

An introduction to the theory of rational integers; divisibility, the unique factorization theorem; congruences, quadratic residues. Selections from the following topics: cryptology; Diophantine equations; asymptotic prime number estimates; continued fractions; algebraic integers. Four class hours per week. Offered in alternate years.

In a typical week, two synchronous class meetings will be held, two asynchronous lectures will be posted, and ample office hours will be held to facilitate small group exchange and answer individual questions.

Requisite: MATH 121 or consent of the instructor. Limited to 25 students. Spring semester. Professor Call.

Many security problems arise when two computers must communicate on a channel with eavesdroppers or malicious attackers. Public-key cryptography applies ideas from number theory and abstract algebra to address these problems. This course concerns the mathematical theory and algorithms needed to construct the most commonly-used public-key ciphers and digital signature schemes, as well as the attacks that must be anticipated when designing such systems. Several topics from number theory, abstract algebra, and algorithms will be introduced, including discrete logarithms, integer factorization algorithms, and elliptic curves. Depending on time and student interest, we may cover some newer systems that are believed to be secure against attacks by quantum computers but not yet commonly implemented in practice. Students will write short programs to implement the systems and to break badly implemented systems. No prior programming experience is expected; basic aspects of programming in Python will be taught in class. Four class hours per week.

Requisite: Experience writing proofs, such as MATH 220/221 or 271/272, or consent of the instructor. Omitted 2020-21. Professor Pflueger.

About 2300 years ago, Euclid introduced the axiomatic method to mathematics in his geometry textbook, the *Elements*. In this book, Euclid deduced the theorems of geometry from a small number of simple axioms about points, lines, and circles. Among his axioms is the parallel axiom, which asserts that if we are given a line and a point not on the line, then there is a unique line through the given point that is parallel to the given line.

Over 2000 years after Euclid, mathematicians discovered that by replacing Euclid's parallel axiom with its negation, we can develop a different kind of geometry in which we still have geometric objects like triangles and circles, but many of the theorems and formulas are different. For example, the sum of the angles of a triangle will always be less than 180 degrees, and this sum will determine the area of the triangle.

In this course we will study both Euclidean and non-Euclidean geometry. We will also consider the fascinating history of how non-Euclidean geometry was discovered. Four class hours per week.

Requisite: MATH 121. Fall Semester. Professor Contreras Palacios.

The study of differential equations is an important part of mathematics that involves many topics, both theoretical and practical. The course will cover first- and second-order ordinary differential equations, basic theorems concerning existence and uniqueness of solutions and continuous dependence on parameters, long-term behavior of solutions and approximate solutions. The focus of the course will be on connecting the theoretical aspects of differential equations with real-world applications from physics, biology, chemistry, and engineering. Four class hours per week.

Requisite: MATH 211 or consent of the instructor. Limited to 25 students. Spring semester. Professor Yacoubou Djima.

The study of vector spaces over the real and complex numbers, introducing the concepts of subspace, linear independence, basis, and dimension; systems of linear equations and their solution by Gaussian elimination; matrix operations; linear transformations and their representations by matrices; eigenvalues and eigenvectors; and inner product spaces. MATH 271 will feature both proofs and applications, with special attention paid to the theoretical development of the subject. Four class meetings per week.

MATH 271 will be online-only, in which case class time is expected to be split between synchronous Zoom sessions and asynchronous videos and activities.

Requisite: MATH 121 or consent of the instructor. This course and MATH 272 may not both be taken for credit. Limited to 25 students. Fall and spring semesters. The Department.

The study of vector spaces over the real and complex numbers, introducing the concepts of subspace, linear independence, basis, and dimension; systems of linear equations and their solution by Gaussian elimination; matrix operations; linear transformations and their representations by matrices; eigenvalues and eigenvectors; and inner product spaces. This course will feature both proofs and applications, with special attention paid to applied topics such as least squares and singular value decomposition. Four class hours per week, with occasional in-class computer labs.

Requisite: MATH 121 or consent of the instructor. This course and MATH 271 may not both be taken for credit. Limited to 25 students. Spring semester: Professor Culiuc.

This course is a continuation of the material in MATH 271 and 272, providing more insight into abstract vector spaces and operator theory. Topics may include least squares estimates, singular value decompositions, Jordan canonical forms, inner product spaces, linear functionals and duals, orthogonal polynomials, vector and matrix norms, the spectral theorem, eigenvalue inequalities, and error-correcting codes. Time permitting, applications to graph theory and discrete dynamical systems may be explored. Four class hours per week.

Requisites: MATH 271, MATH 272, or consent of the instructor. Limited to 25 students. Spring semester. Professor Culiuc.

A graph is a collection of points with edges drawn between them. Graph theory was first introduced by Leonhard Euler in his solution to the Königsberg bridge problem in 1736. Since then, graph theory has become an active area of study in mathematics due both to its wide array of real life applications in biology, chemistry, social sciences and computer networking, and to its interactions with other branches of mathematics.

The course will start with an overview of the fundamental concepts and general results in graph theory, followed by explorations of a variety of topics in graph theory and their applications, including: connectivity, planar graphs, directed graphs, greedy algorithms, matchings, vertex and edge colorings. The course will end with the introduction of a more advanced topic. Four class hours per week.

Requisite: MATH 271 or 272 or consent of the instructor. MATH 220 or other prior experience with mathematical proofs is recommended. Limited to 30 students. Omitted 2020-21. Professor Contreras Palacios.

This course emphasizes enumerative combinatorics, a classical subject in mathematics related to the theory of counting. Problems in this area often pertain to finding the number of possible arrangements of a set of objects under some particular constraints. This course incorporates a wide set of problems involving enumerative combinatorics, as well as theory and applications. Topics include the sum and product rules; combinations and permutations; binomial and multinomial coefficients; the principle of inclusion and exclusion; generating functions; recurrence relations; Catalan, Stirling, Bell and Eulerian numbers; partitions; tableaux; and stable marriage. Additional topics may vary.

Requisite: MATH 121, and MATH 220 or other prior experience with basic mathematical proof techniques (e.g., induction) by consent of the instructor. Limited to 24 students. Omitted 2020-21.

This course will study numerical techniques for a variety of problems, such as finding roots of polynomials, interpolation, numerical integration, numerical solutions of differential equations, and matrix computations. We will study the underlying theory behind the algorithms, including error analysis, and the algorithms will be implemented using mathematical software to facilitate numerical experimentation.

Requisite: MATH 211 and either 271 or 272, or consent of the instructor. Limited to 24 students. Spring semester. Professor Yacoubou Djima.

Optimization is a branch of applied mathematics focused on algorithms to determine maxima and minima of functions, often under constraints. Applications range from economics and finance to machine learning and information retrieval. This course will first develop advanced linear algebra tools, and then will study methods of convex optimization. Possible topics include linear, quadratic, second-order cone, and semidefinite models. Several applications will be explored, and algorithms will be implemented using mathematical software to aid numerical experimentation.

Requisite: MATH 211 and 271 or 272, or consent of the instructor. Limited to 30 students. Omitted 2020-21. Professor Yacoubou Djima.

The theory of partitions is a fundamental branch of combinatorics and number theory pertaining to enumerative properties and patterns of the integers. With its mathematical origins tracing back to the seventeenth century, partition theory has evolved through contributions made by many influential mathematicians including Euler, Legendre, Hardy, Ramanujan, Selberg and Dyson, and continues to be an active area of study today. Topics include partition identities and bijections, Ferrers diagrams and Durfee squares, partition generating functions and q-series, the pentagonal number theorem, q-binomial numbers (Gaussian polynomials), and partition congruences.

Requisite: MATH 121 and 220, or other significant experience with proofs, or by consent of the instructor. Limited to 24 students. Spring semester. Professor Folsom.

The first half of the course covers continuous and discrete Fourier transforms (including convolution and Plancherel’s formula), Fourier series (including convergence and the fast Fourier transform algorithm), and applications like heat conduction along a rod and signal processing. The second half of the course is devoted to wavelets: Haar bases, the discrete Haar transform in 1 and 2 dimensions with application to image analysis, multiresolution analysis, filters, and wavelet-based image compression like JPEG2000. Three class hours per week plus a weekly one-hour computer laboratory.

Requisite: MATH 211 and 271 or 272. Omitted 2020-21. Professor Yacoubou Djima.

Network structures and network dynamics are a fundamental modern tool for modeling a broad range of problems from fields like economics, biology, physics, and sociology. Mathematical and machine learning techniques can be used to reveal underlying network structures. The course will use graphs (sets of nodes connected by edges) as a common language to describe networks and their properties. On the theoretical side, the course will cover topics such as basic probability, degree distribution, spectral graph theory (adjacency matrix, graph Laplacian), diffusion geometries, and random graph models. Applications will range over topics such as epidemics, marketing, prediction of new links in a social network, and game theory. The course will also include hands-on experiments and simulations. Three class meetings per week.

Requisite: MATH 271 or MATH 272 or instructor's permission. Limited to 24 students. Omitted 2020-21. Professor Yacoubou Djima.

An introduction to analytic functions; complex numbers, derivatives, conformal mappings, integrals. Cauchy’s theorem; power series, singularities, Laurent series, analytic continuation; Riemann surfaces; special functions. Four class hours per week.

Requisite: MATH 211 and prior experience with mathematical proofs, or consent of the instructor. Fall semester. Professor Culiuc.

A brief consideration of properties of sets, mappings, and the system of integers, followed by an introduction to the theory of groups and rings including the principal theorems on homomorphisms and the related quotient structures; integral domains, fields, polynomial rings. Four class hours per week.

Requisite: MATH 211 and either MATH 271 or 272, or consent of the instructor. Students with a grade of B+ or lower in linear algebra are encouraged to take another 200-level course with proofs before taking MATH 350.

Class time is expected to include both synchronous Zoom sessions and asynchronous videos and activities.

Limited to 25 students. Fall semester: Professor Gunturkun. Spring semester: Professor Daniels.

Completeness of the real numbers; topology of n-space including the Bolzano-Weierstrass and Heine-Borel theorems; sequences, properties of continuous functions on sets; infinite series, uniform convergence. The course may also study the Gamma function, Stirling’s formula, or Fourier series. Four class hours per week.

Fall 2020 sections of MATH 355 will be online-only, in which case the course’s full syllabus will be covered through a combination of synchronous meetings for each section and asynchronous lectures supported by an ample number of Zoom office hours.

Requisite: MATH 211 and either MATH 271 or 272, or consent of the instructor. Students with a grade of B+ or lower in linear algebra are encouraged to take another 200-level course with proofs before taking MATH 355.

Limited to 25 students. The Department.

The p-adic numbers were first introduced by Kurt Hensel near the end of the nineteenth century. Since their introduction they have become a central object in modern number theory, algebraic geometry, and algebraic topology. These numbers give a new set of fields (one for each prime p) that contain the rational numbers and behave in some ways like the real numbers, but they also possess some unique and unexpected properties. The main objective of this course will be to rigorously construct the p-adic numbers and explore some of the algebraic, analytic, and topological properties that make them interesting. Four class meetings per week.

Requisite: MATH 350 and MATH 355, or consent of the instructor. Limited to 32 students. Omitted 2020-21. Professor Daniels.

A stochastic process is a collection of random variables used to model the evolution of a system over time. Unlike deterministic systems, stochastic processes involve an element of randomness or uncertainty. Examples include stock market fluctuations, audio signals, EEG recordings, and random movement such as Brownian motion and random walks. Topics will include Markov chains, martingales, Brownian motion, and stochastic integration, including Ito’s formula. Four class hours per week, with weekly in-class computer labs.

Requisite: MATH 360 or consent of the instructor. Limited to 24 students. Omitted 2020-21. Professor Leise.

This course builds upon the material in MATH 355 (Introduction to Analysis) in order to rigorously develop basic tools for studying functions of more than one real variable. While the setting in MATH 355 is the real number line, the context for this course will be the n-dimensional Euclidean space. Many facets of analysis on this n-dimensional space will be explored including its topological properties as well as differentiation and Riemann integration in n-variables. The course will cover fundamental results such as the celebrated implicit and inverse function theorems. Time permitting, we may discuss additional topics such as analysis on metric spaces. Four class hours per week.

Requisite: MATH 355 and either MATH 271 or 272; or consent of the instructor. Limited to 25 students. Omitted 2020-21. Professor Alvarado.

This course will explore the geometry of curves and surfaces in *n*-dimensional Euclidean space. For curves, the key concepts are curvature and torsion, while for surfaces, the key players are Gaussian curvature, geodesics, and the Gauss-Bonnet Theorem. Other topics covered may include (time permitting) the Four Vertex Theorem, map projections, the Hairy Ball Theorem, and minimal surfaces.

Requisites: MATH 211, MATH 271 or 272, and MATH 355 or consent of the instructor. Omitted 2020-21.

The study of geometric objects by means of their defining equations dates back to the introduction of coordinates by Descartes in 1637. The advent of computers, along with the increase in their processing speed in the last sixty years, has revolutionized the subject, shaping the fields of computational commutative algebra and computational algebraic geometry.

This course will start by studying the theory of Gröbner bases, introduced in 1965, which make possible the implementation of algorithms that facilitate the manipulation and understanding of algebraic equations. We will also develop a dictionary between algebra and geometry, exploring the structure of ideals in polynomial rings and their quotients. In addition, we will discuss the significance of monomial and binomial ideals. The course will end with student presentations on applications of algebraic geometry to robotics, invariant theory, graph theory, algebraic statistics, and other topics. Four class hours per week, including a weekly one-hour computer lab.

Requisite: MATH 350 or consent of the instructor. Omitted 2020-21.

Mathematicians confirm their answers to mathematical questions by writing proofs. But what, exactly, is a proof? This course begins with a precise definition specifying what counts as a mathematical proof. This definition makes it possible to carry out a mathematical study of what can be accomplished by means of deductive reasoning and, perhaps more interestingly, what cannot be accomplished. Topics will include the propositional and predicate calculi, completeness, compactness, and decidability. At the end of the course we will study Gödel’s famous Incompleteness Theorem, which shows that there are statements about the positive integers that are true but impossible to prove. Four class hours per week. Offered in alternate years.

Requisite: MATH 220, 271, 272, or 355, or consent of the instructor. Omitted 2020-21. Professor Ching.

Independent reading course.

Fall and spring semesters. The Department.

Lie groups and Lie algebras appear naturally in the study of symmetries of geometric objects. Lie algebras carry local information and can be studied using tools from linear algebra. Finite dimensional Lie groups can be constructed using techniques from calculus and group theory.

This course serves as a first introduction to Lie groups and Lie algebras. We will examine the structure of finite dimensional matrix Lie groups, the exponential and differentiation maps, as well as compact Lie groups. We will also study Lie algebras, ideals and homomorphisms, nilpotent and solvable Lie algebras, Cartan subalgebras, semisimplicity and root systems, and the classification of semisimple Lie algebras. This classification is not only a fundamental result in Lie Theory, but is also an archetype of classifications that appear in other areas of math. More amazingly, this classification is embodied in simple combinatorial pictures called Dynkin diagrams, which underlie surprisingly disparate fields, such as geometric group theory, quiver representation theory, and string theory. Four class meetings per week.

Requisite: MATH 350 or consent of the instructor. Limited to 18 students. Omitted 2020-21. Professor Contreras Palacios.

The quadratic formula shows us that the roots of a quadratic polynomial possess a certain symmetry. Galois Theory is the study of the corresponding symmetry for higher degree polynomials. We will develop this theory starting from a basic knowledge of groups, rings, and fields. One of our main goals will be to prove that there is no general version of the quadratic formula for a polynomial of degree five or more. Along the way, we will also show that a circular cake can be divided into 17 (but not 7) equal slices using only a straight-edged knife.

Requisite: MATH 350 or consent of the instructor. Omitted 2020-21. Professor R. Benedetto.

An elliptic curve is the set of zeros of a cubic polynomial in two variables. If the polynomial has rational coefficients, it is natural to ask for a description of those zeros whose coordinates are either integers or rational numbers. Our study of elliptic curves will focus on this fundamental problem and reveal a fascinating interplay between algebra, geometry, analysis and number theory. Topics discussed will include the geometry and group structure of elliptic curves, the Nagell-Lutz Theorem describing points of finite order, and the Mordell-Weil theorem on the finite generation of the group of rational points. Additional topics may include elliptic curve cryptography, Lenstra's algorithm using elliptic curves to factor large integers, the Thue-Siegel Theorem on the finiteness of the set of integer points, and the crucial role the theory of elliptic curves played in Wiles' proof of Fermat's Last Theorem. By bringing together techniques from a wide range of mathematical disciplines, we plan to illustrate the unity of mathematics and introduce active areas of research. Four class hours per week.

In a typical week, two synchronous class meetings will be held, two asynchronous lectures will be posted, and ample office hours will be held to facilitate small group exchange and answer individual questions.

Requisite: MATH 350, or consent of the instructor. Spring semester. Professor Call.

An introduction to Lebesgue measure and integration; topology of the real numbers; inner and outer measures and measurable set; the approximation of continuous and measurable functions; the Lebesgue integral and associated convergence theorems; the Fundamental Theorem of Calculus. Four class hours per week.

Requisite: MATH 355. Omitted 2020-21. Professor Culiuc.

An introduction to general topology: the topology of Euclidean, metric and abstract spaces, with emphasis on such notions as continuous mappings, compactness, connectedness, completeness, separable spaces, separation axioms, and metrizable spaces. Additional topics may be selected to illustrate applications of topology in analysis or to introduce the student briefly to algebraic topology. Four class hours per week. Offered in alternate years.

MATH 455 will be online-only, and will involve a variety of online and offline activities, including all-class Zoom meetings, small group sessions, individual office hours and problem sets. Students will be expected to engage fully with the course material, and with each other, both during live video meetings and via online discussion forums. Alternative arrangements will be made for students in time zones that make attending specific meetings difficult, or who have other challenges with doing work for the course online. Students who are on-campus may be able to carry out some of the small group work in-person.

Requisite: MATH 355. Spring semester. Professor Ching.

This course is an introduction to Analytic Number Theory, a foundational subject in mathematics which dates back to the 1800s and is still a major research area today. The subject generally uses tools and techniques which are analytic in nature to solve problems primarily related to integers. Asymptotic and summation results and methods are of great significance in Analytic Number Theory. Two primary course objectives are to state and prove two major theorems: Dirichlet's Theorem on Primes in Arithmetic Progressions, and the Prime Number Theorem. In particular, we will study Selberg's "elementary" proof of the Prime Number Theorem, as well as an analytic proof. Additional topics may include: arithmetic functions, especially their averages, their asymptotics, and related summation formulae; Dirichlet convolutions; characters and Gauss sums; and an introduction to Dirichlet series, such as the Riemann zeta-function and L-functions. Further topics may vary.

Requisite: At least two among MATH 345, MATH 350, and MATH 355, with MATH 345 preferred; or by consent of the instructor. Prior experience with number theory, such as MATH 250, may be helpful but is not required. Fall semester. Professor Folsom.

Open to seniors with the consent of the Department. Fall semester. The Department.

In this data-driven, digital age, being able to reason through the numbers we see on a daily basis via the media, advertising, and other sources is critical. This discussion-based course is designed to help build statistical and data literacy. Examples will be focused on the use of data and statistics as related to the public health field, including smoking, diet, and mass incarceration. Many topics from introductory statistics will be covered including probability, study design, sampling, and confidence intervals. This course will be conducted inside a correctional facility and enroll an equal number of Amherst students and residents of the facility. Permission to enroll in the course will be granted on the basis of a questionnaire and interview with the instructor. If space is available, first-year students will be admitted during the add/drop period. This course is not intended for students who want to major in statistics. One class meeting per week.

Limited to 12 students. Omitted 2020-21. Professor Correia.

This course provides a basic foundation in descriptive and inferential statistics, including constructing models from data. Students will learn to think critically about data, produce meaningful graphical and numerical summaries of data, apply basic probability models, and utilize statistical inference procedures using computational tools. Topics include basic descriptive and inferential statistics, visualization, study design, and multiple regression. Students who have taken a semester of calculus (MATH 111 or higher, or equivalent placement) or who are planning to major in statistics should take STAT 135/MATH 135 instead of this course. (Students who have taken STAT/MATH 135, PSYC 122, or ECON 360/361 may not also receive credit for STAT 111/111E, and STAT 111/111E does not count towards the major in Mathematics.)

Limited to 24 students per section. Permission with consent of the instructor. Spring semester. Professor Matheson.

This course is an introduction to nonparametric and distribution-free statistical procedures and techniques. These methods rely heavily on counting and ranking techniques and will be explored through both theoretical and applied perspectives. One- and two-sample procedures will provide students with alternatives to traditional parametric procedures, such as the t-test. We will also investigate correlation and regression in a nonparametric setting. A variety of other topics may be explored in the nonparametric setting including resampling techniques (for example, bootstrapping), categorical data and contingency tables, density estimation, and the one-way and two-way layouts for analysis of variance. The course will emphasize data analysis (with appropriate use of statistical software) and the intuitive nature of nonparametric statistics.

Requisite: STAT 111 or STAT 135. Limited to 24 students. Omitted 2020-21. Professor McShane.

This course is an intermediate applied statistics course that builds on the statistical data analysis methods introduced in STAT 111/111E or STAT 135. Students will learn how to pose a statistical question, perform appropriate statistical analysis of the data, and properly interpret and communicate their results. Emphasis will be placed on the use of statistical software, data wrangling, model fitting, and assessment. Topics covered will include ethics, experimental design, resampling approaches, analysis of variance models, multiple regression, model selection, and logistic regression. No prior experience with statistical software is expected.

This course is expected to be a mixture of synchronous and asynchronous meetings, including small-group discussions and/or projects, which will foster community building.

Requisite: STAT 111 or 135. Limited to 24 students. Four spots reserved for incoming first-year students in each Fall section. Fall and Spring semester. Professor Liao.

Computational data analysis is an essential part of modern statistics and data science. This course provides a practical foundation for students to think with data by participating in the entire data analysis cycle. Students will generate statistical questions and then address them through data acquisition, cleaning, transforming, modeling, and interpretation. This course will introduce students to tools for data management and wrangling that are common in data science and will apply those tools to real-world applications. Students will undertake practical analyses of large, complex, and messy data sets leveraging modern computing tools.

Requisite: STAT 111 or STAT 135 and COSC 111 or consent of the instructor. Limited to 24 students. Fall and Spring semesters. Professor Correia.

Making sense of a complex, high-dimensional data set is not an easy task. The analysis chosen is ultimately based on the research question(s) being asked. This course will explore how to visualize and extract meaning from large data sets through a variety of analytical methods. Methods covered include principal components analysis and selected statistical and machine learning techniques, both supervised (e.g. classification trees and random forests) and unsupervised (e.g. clustering). Additional methods covered may include factor analysis, dimension reduction methods, or network analysis at instructor discretion. This course will feature hands-on data analysis with statistical software, emphasizing application over theory.

The course is expected to include small group work, interactive labs, peer interactions such as peer review and short presentations, and a personal project, to foster student engagement in the course and with each other.

Requisite: STAT 111 or 135. Limited to 24 students. Fall semester. Professor Wagaman.

Statistical Communication is an important component of the capacity to "think with data." This course will integrate theoretical and practical aspects of statistics with a focus on communicating results and their implications. Students will gain experience clearly synthesizing and explaining complex data using diverse predictive and explanatory models. Learning objective include: understanding the role of a statistician, developing communications skills, working collaboratively on group projects, designing studies to collect information, acquiring existing data resources, utilizing publications in statistics, creating reproducible research and developing oral arguments, relevant project reports, and dynamic graphical displays. Emphasis will be placed on the use of statistical software, data management, visual presentation, and oral and written communication skills that are necessary for communicating technical content.

Requisite: STAT 230 or consent of the instructor. Limited to 24 students. Fall semester. Professor Matheson.

Epidemiology is the study of the distribution and determinants of disease and health in human populations. It typically involves the analysis of multivariate observational data that pose challenges when trying to make causal conclusions. The course will focus on reasoning about cause and effect, study design, bias and missing data, models and analysis of risk, detection and classification, and modern approaches to confounding and causal inference. Topics include: Measures of disease (incidence and prevalence); Measures of association (relative risk, odds ratio, relative hazard, excess risk, attributable risk); Study designs (exposure and disease base sampling); Assessing significance in a 2x2 table; Assessing significance in a 2x2x2 table; Missing data; Introduction to confounding; Matching; Propensity score adjustment; Unmeasured confounding; Introduction to causal inference and counterfactuals; Causal graphs; and D-separation.

Requisite: STAT-230 (or PSYC 122 and PSYC 200 and consent of the instructor). Omitted 2020-21. Professor Horton.

Competitions, which can include individual and team sports, eSports, tabletop gaming, preference formation, and elections, produce data dependent on interrelated competitors and the decision, league, or tournament format. In this course, students will learn to think about the ways a wide variety of statistical methodologies can be applied to the complex and unique data that emerge through competition, including paired comparisons, decision analysis, rank-based and kernel methods, and spatio-temporal methods. The course will focus on the statistical theory relevant to analyzing data from contests and place an emphasis on simulation and data visualization techniques. Students will develop data collection, manipulation, exploration, analysis, and interpretation skills individually and in groups. Applications may include rating players and teams, assessing shot quality, animating player tracking data, roster construction, comparing alternative voting systems, developing optimal strategies for games, and predicting outcomes. Prior experience with probability such as STAT 360 may be helpful, but is not required.

Requisite: STAT 230 and STAT 231. Limited to 24 students. Spring semester. Professor McShane.

Linear regression and logistic regression are powerful tools for statistical analysis, but they are only a subset of a broader class of generalized linear models. This course will explore the theory behind and practical application of generalized linear models for responses that do not have a normal distribution, including counts, categories, and proportions. We will also delve into extensions of these models for dependent responses such as repeated measures over time.

The course will use Moodle to foster asynchronous student engagement with peers and with course material, and will have synchronous activity-based sessions primarily using Zoom. Opportunities for in-person engagement for on-campus students (e.g., office hours, study sessions) are also expected.

Requisite: STAT 230 and STAT 370. Limited to 20 students. Spring semester. Professor Bailey.

Fall and spring semesters. The Department.

Our world is awash in data. To allow decisions to be made based on evidence, there is a need for statisticians to be able to make sense of the data around us and communicate their findings. In this course, students will be exposed to advanced statistical methods and will undertake the analysis and interpretation of complex and real-world datasets that go beyond textbook problems. Course topics will vary from year to year depending on the instructor and selected case studies but will include static and dynamic visualization techniques to summarize and display high dimensional data, advanced topics in design and linear regression, ethics, and selected topics in data mining. Other topics may vary but might include nonparametric analysis, spatial data, and analysis of network data. Through a series of case studies, students will develop the capacity to think and compute with data, undertake and assess analyses, and effectively communicate their results using written and oral presentation.

Requisite: STAT 230, STAT 370, and the computing requirement; or consent of the instructor. Recommended requisite: STAT 231. Limited to 20 students. Fall semester. Professor Horton.

Spring semester. The Department.