Search Results
Your search for courses · during 26SP · tagged with MATH Electives · returned 10 results
-
CS 252 Algorithms 6 credits
A course on techniques used in the design and analysis of efficient algorithms. We will cover several major algorithmic design paradigms (greedy algorithms, dynamic programming, divide and conquer, and network flow). Along the way, we will explore the application of these techniques to a variety of domains (natural language processing, economics, computational biology, and data mining, for example). As time permits, we will include supplementary topics like randomized algorithms, advanced data structures, and amortized analysis.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 252.01 Spring 2026
- Faculty:Eric Alexander 🏫 👤
- Size:28
- M, WAnderson Hall 329 9:50am-11:00am
- FAnderson Hall 329 9:40am-10:40am
-
28 seats held for CS Match until the day after X priority registration.
-
CS 254 Computability and Complexity 6 credits
An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 254.01 Spring 2026
- Faculty:Chelsey Edge 🏫 👤
- Size:28
- M, WLanguage & Dining Center 104 12:30pm-1:40pm
- FLanguage & Dining Center 104 1:10pm-2:10pm
-
28 seats held for CS Match until the day after X priority registration.
-
CS 254.02 Spring 2026
- Faculty:Anna Rafferty 🏫 👤
- Size:28
- M, WLeighton 305 9:50am-11:00am
- FLeighton 305 9:40am-10:40am
-
28 seats held for CS Match until the day after X priority registration.
-
MATH 241 Ordinary Differential Equations 6 credits
Ordinary differential equations are a fundamental language used by mathematicians, scientists, and engineers to describe processes involving continuous change. In this course we develop ordinary differential equations as models of real world phenomena and explore the mathematical ideas that arise within these models. Topics include separation of variables; phase portraits; equilibria and their stability; non-dimensionalization; bifurcation analysis; and modeling of physical, biological, chemical, and social processes.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student must have completed any of the following course(s): MATH 134 or MATH 232 AND MATH 120 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 271 Optimization 6 credits
Optimization is all about selecting the "best" thing. Finding the most likely strategy to win a game, the route that gets you there the fastest, or the curve that most closely fits given data are all examples of optimization problems. In this course we study linear optimization (also known as linear programming), the simplex method, and duality from both a theoretical and a computational perspective. Applications will be selected from statistics, economics, computer science, and more. Additional topics in nonlinear and convex optimization will be covered as time permits.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student must have completed any of the following course(s): MATH 134 or MATH 232 AND MATH 120 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 295 Tessellation 6 credits
This course explores a particularly visual sort of mathematical pattern: a tessellation. A tessellation is a way of covering the plane with shapes (called “tiles”) that don’t overlap. This class will explore questions like: Is it possible to make a tessellation out of a given set of tiles? How many different tessellations can I create from this set of tiles? We’ll cover both classical results (it is impossible to tile the plane with heptagons!), and the 2023 construction of the “Einstein tile”: the first known polygon that tiles the plane but never periodically. Links will be made with graph theory, topology, and geometry.
Repeatable: This course is repeatable provided the topics are different.
Sophomore Priority
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 321 Real Analysis I 6 credits
A systematic study of single-variable functions on the real numbers. This course develops the mathematical concepts and tools needed to understand why calculus really works: the topology of the real numbers, limits, differentiation, integration, convergence of sequences, and series of functions.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 AND MATH 210 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 341 Partial Differential Equations 6 credits
An introduction to partial differential equations with emphasis on the heat equation, wave equation, and Laplace’s equation. Topics include the method of characteristics, separation of variables, Fourier series, Fourier transforms and existence/uniqueness of solutions.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 241 with grade of C- or better.
-
MATH 352 Galois Theory 6 credits
In the nineteenth century, Évariste Galois discovered a deep connection between field theory and group theory. Now known as Galois theory, this led to the resolution of several centuries-old problems, including whether there is a version of the quadratic formula for higher-degree polynomials, and whether the circle can be squared. Today Galois theory is a fundamental concept for many mathematical fields, from topology to algebra to number theory. This course develops the theory in a modern framework, and explores several applications. Topics include field extensions, classical constructions, splitting fields, the Galois correspondence, Galois groups of polynomials, and solvability by radicals.
This course can be repeated only by students who took MATH 352 22-23
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 342 with grade of C- or better.
-
MATH 362 Representation Theory of Finite Groups 6 credits
Representation theory is the study of mathematical structures via the tools of linear algebra. The first objects to be studied in this way were finite groups at the end of the nineteenth century, motivated by the powerful framework of characters in number theory, but the field has generalized incredibly due to the prevalence of symmetry throughout mathematics, physics, and beyond. In this course the focus is on finite groups. Topics include Maschke’s theorem, complete reducibility, and Schur’s lemma; characters, orthogonality relations, and character tables; Fourier transformations and random walks. Additional topics may include Burnside’s Lemma, Frobenius reciprocity, and an exploration of representations of infinite groups.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 342 with grade of C- or better.
-
STAT 250 Introduction to Statistical Inference 6 credits
Introduction to modern mathematical statistics. The mathematics underlying fundamental statistical concepts will be covered as well as applications of these ideas to real-life data. Topics include: resampling methods (permutation tests, bootstrap intervals), classical methods (parametric hypothesis tests and confidence intervals), parameter estimation, goodness-of-fit tests, regression, and Bayesian methods. The statistical package R will be used to analyze data sets.
- Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): MATH 240 with a grade of C- or better.