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 R. Benedetto.

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. Four class meetings per week, one of which is a two-hour group-work day.

Requisite: MATH 105. Spring semester. Lecturer D. Benedetto.

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.

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. Fall semester: TBA. Spring semester: Professor Folsom.

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.

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. Both semesters. Professor Call and Lecturer D. Benedetto.

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 such as environmental studies and biology (e.g., air pollution, ground water flow, populations of interacting species, social networks). 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. Omitted 2016-17.

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 209 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. Spring semester. Professors Ching and Moss.

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.

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 semester: Professor R. Benedetto and Visiting Assistant Professors Naqvi, Sosa Castillo and Zhang. Spring: Professor Leise and Visiting Professor Zhang.

This course is an introduction to some topics in mathematics that do not require the calculus. The topics covered include logic, elementary set theory, functions, relations and equivalence relations, mathematical induction, counting principles, and graph theory. Additional topics may vary from year to year. This course serves as an introduction to mathematical thought and pays particular attention to helping students learn how to write proofs. Four class hours per week.

Limited to 25 students. Fall semester: Visiting Professor Juul. Spring semester: Visiting Professor Naqvi.

MATH 225 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, MATH 225 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. Fall semester. Professor Folsom.

(Offered as MATH 240 and BIOL 240.) With new experimental techniques leading to large biological data sets of increased quality, the ability to analyze biological systems using mathematical modeling approaches has become an integral part of modern biology. This course aims to provide students interested in the interface between biology and mathematics with an integrated understanding of some of the mathematical and computational techniques used in this field. The mathematical approaches we will use to study biological systems will include discrete and continuous dynamical models as well as probability models and parameter estimation algorithms.

Requisite: MATH 211 and BIOL 181 or 191, or permission of the instructor. Limited to 24 students. Omitted 2016-17.

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.

Requisite: MATH 121 or consent of the instructor. Spring semester. Visiting Professor Juul.

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: Mathematics 121. Omitted 2016-17.

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. Spring semester. Visiting Professor Sosa Castillo.

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.

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 semester: Professors Ching and Daniels. Spring semester: Professor Ching.

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 272 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. Visiting Professor Naqvi.

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 permission of instructor. MATH 220 or other prior experience with mathematical proofs is recommended. Limited to 30 students. Omitted 2016-17.

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 permission of the instructor. Limited to 24 students. Fall semester. Professor Leise.

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, including 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 either 271 or 272, or permission of the instructor. Limited to 30 students. Spring semester. Professor Leise.

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 220 and 121, or other significant experience with proofs, or by consent of instructor. Limited to 24 students.* *Fall 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 2016-17. Professor TBA.

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. Visiting Professor Zhang.

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 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. Limited to 25 students. Fall semester: Visiting Professor Sosa Castillo. Spring: Visiting Professor Juul.

Completeness of the real numbers; topology of n-space including the Bolzano-Weierstrass and Heine-Borel theorems; sequences, properties of functions continuous 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.

Requisite: MATH 211 and prior experience with mathematical proofs (MATH 271 or 272 recommended), 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 of 25 students. Fall semester: Professor Call. Spring semester: Professor Cox.

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. While these fields are similar to the real numbers in some respects, 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.

Requisite: Math 350 or consent of the instructor. Limited to 32 students. Spring semester. 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 instructor. Limited to 24 students. Omitted 2016-17. Professor TBA.

Representation theory concerns the study of groups by expressing their elements as linear transformations of vector spaces. This approach gives us a more concrete way to think about groups via matrices, and it allows us to use tools from linear algebra to study them. Topics covered in this course include group actions, representations and modules, subrepresentations and homomorphisms, irreducibility, characters and character tables, and induced and restricted representations. We will also explore some applications to physics and other areas of mathematics.

Requisite: MATH 350 or consent of the instructor. Limited to 24 students. Priority to pre-registered students, math majors, and juniors and seniors. Fall semester. Visiting Professor Naqvi.

Most mathematicians consider set theory to be the foundation of mathematics, because everything that is studied in mathematics can be defined in terms of the concepts of set theory, and all the theorems of mathematics can be proven from the axioms of set theory. This course will begin with the axiomatization of set theory that was developed by Ernst Zermelo and Abraham Fraenkel in the early part of the twentieth century. We will then see how all of the number systems used in mathematics are defined in set theory, and how the fundamental properties of these number systems can be proven from the Zermelo-Fraenkel axioms. Other topics will include the axiom of choice, infinite cardinal and ordinal numbers, and models of set theory. Four class hours per week.

Requisite: MATH 220, 271, 272, or 355, or consent of the instructor. Fall semester. Professor TBA.

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 2016-17.

Fall and spring semesters. The Department.

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 2016-17. Professor Ching.

The topic will vary from year to year. The study of geometric objects by means of their defining equations dates back to the introduction of coordinates by Descartes in 1637. This course will introduce algorithmic methods for manipulating and understanding algebraic equations and will develop a dictionary between algebra and geometry. We will also explore the structure of ideals in polynomial rings and the resulting quotient rings. The course will end with student presentations on applications of algebraic geometry to robotics, geometric theorem proving, invariant theory, graph theory, and sudoku. Three class hours per week plus a weekly one-hour computer lab.

Requisite: MATH 350. Limited to 16 students. Omitted 2016-17.

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 2016-17. Professor TBA.

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.

Requisite: MATH 355. Spring semester. Visiting Professor Zhang.

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

Introduction to Statistics 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 are majoring in mathematics should take STAT 135/MATH 135 instead of this course.

Limited to 24 students per section. Fall semester. Professor Liao.

Bayesian statistics is founded upon the idea that our beliefs about the world are constantly revised with the incorporation of new information. This course provides a principled introduction to Bayesian statistics. We begin with the basic building blocks of Bayesian inference: the likelihood, prior, and posterior distributions. We will then show how to simulate from the posterior distribution using the Markov chain Monte Carlo (MCMC) method. Single and multivariate models will be considered as well as hierarchical models, such as Bayesian linear regression, and other more advanced topics. The course will emphasize problem solving and data analysis via statistical software. Four class hours per week.

Requisite MATH 111 and STAT 111/135 or permission of instructor. Limited to 20 students. Omitted 2016-17.

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, regression, and one-way analysis of variance techniques 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 two-way layout. The course will emphasize data analysis (with appropriate use of statistical software) and the intuitive nature of nonparametric statistics. Four class hours per week.

Requisite: STAT 111 or STAT 135 or equivalent. Omitted 2016-17. Professor Wagaman.

This course is an intermediate applied statistics course that builds on the statistical data analysis methods introduced in STAT 111 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 manipulation, model fitting, and assessment. Topics covered will include ethics, experimental design, parametric and nonparametric methods, resampling approaches, analysis of variance models, multiple regression, model selection, and logistic regression. Four class hours per week.

Requisite: STAT 111 or 135. Limited to 24 students. Fall semester: Admission with consent of the instructor. Fall and spring semesters. Professor Wagaman.

Real world experiments often provide data that consist of many variables. When confronted with a large number of variables, there may be many different directions to proceed, but the direction chosen is ultimately based on the question(s) being asked. In biology, one could ask which observed characteristics distinguish females from males in a given species. In archaeology, one could examine how the observed characteristics of pottery relate to their location on the site, look for clusters of similar pottery types, and gain valuable information about the location of markets or religious centers in relation to residential housing. This course will explore how to visualize large data sets and study a variety of methods to analyze them. Methods covered include principal components analysis, factor analysis, classification techniques (discriminant analysis and classification trees) and clustering techniques. This course will feature hands-on data analysis with statistical software, emphasizing application over theory. Four class hours per week.

Requisite: STAT 111 or 135. Limited to 20 students. Fall semester. Professor Persson.

This course is an intermediate applied statistics course that builds on the statistical concepts introduced in STAT 111 or STAT 135 and data analysis methods introduced in 200-level statistics courses. It will focus on the analysis and mapping of environmental and social data in a spatial context, including continuous process data and point process data. Other topics include descriptive and inferential techniques used in quantitative geographic analysis, parametric and nonparametric analyses, model assessment, and visualization. Students will build computing skills and use R for data display, modeling, and communication. Two class meetings per week, 80 minutes each.

Requisite: Previous 200-level statistics coursework, or any 2 courses in statistics, or permission of the instructor. Limited to 24 students. Omitted 2016-17.

Statistical communication is an important component of the capacity to "think with data." The 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 objectives include: understanding the role of a statistician, developing communication 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. Spring semester. Visiting Lecturer Matheson.

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. Topics may include visualization techniques to summarize and display high dimensional data, advanced topics in design and linear regression, selected topics in data mining, nonparametric analysis, 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 (formerly MATH 230), STAT 370 (formerly MATH 430 and STAT 430) and the computing requirement; or consent of the instructor. Limited to 20 students. Fall semester. Professor Horton.