Online courses directory (118)
18.104 is an undergraduate level seminar for mathematics majors. Students present and discuss subject matter taken from current journals or books. Instruction and practice in written and oral communication is provided. The topics vary from year to year. The topic for this term is Applications to Number Theory.
This is an advanced topics course in model theory whose main theme is simple theories. We treat simple theories in the framework of compact abstract theories, which is more general than that of first order theories. We cover the basic properties of independence (i.e., non-dividing) in simple theories, the characterization of simple theories by the existence of a notion of independence, and hyperimaginary canonical bases.
This calculus course covers differentiation and integration of functions of one variable, and concludes with a brief discussion of infinite series. Calculus is fundamental to many scientific disciplines including physics, engineering, and economics.
Course Format
This course has been designed for independent study. It includes all of the materials you will need to understand the concepts covered in this subject. The materials in this course include:
- Lecture Videos with supporting written notes
- Recitation Videos of problem-solving tips
- Worked Examples with detailed solutions to sample problems
- Problem sets with solutions
- Exams with solutions
- Interactive Java Applets ("Mathlets") to reinforce key concepts
Content Development
David Jerison
Arthur Mattuck
Haynes Miller
Benjamin Brubaker
Jeremy Orloff
This course is a broad treatment of statistics, concentrating on specific statistical techniques used in science and industry. Topics include: hypothesis testing and estimation, confidence intervals, chi-square tests, nonparametric statistics, analysis of variance, regression, correlation, decision theory, and Bayesian statistics.
The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.
This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.
The main goal of this course is to study the generalization ability of a number of popular machine learning algorithms such as boosting, support vector machines and neural networks. Topics include Vapnik-Chervonenkis theory, concentration inequalities in product spaces, and other elements of empirical process theory.
This course is organized around algorithmic issues that arise in machine learning. Modern machine learning systems are often built on top of algorithms that do not have provable guarantees, and it is the subject of debate when and why they work. In this class, we focus on designing algorithms whose performance we can rigorously analyze for fundamental machine learning problems.
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.
This course will give a detailed introduction to the theory of tensor categories and review some of its connections to other subjects (with a focus on representation-theoretic applications). In particular, we will discuss categorifications of such notions from ring theory as: module, morphism of modules, Morita equivalence of rings, commutative ring, the center of a ring, the centralizer of a subring, the double centralizer property, graded ring, etc.
This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.
Wavelets are localized basis functions, good for representing short-time events. The coefficients at each scale are filtered and subsampled to give coefficients at the next scale. This is Mallat's pyramid algorithm for multiresolution, connecting wavelets to filter banks. Wavelets and multiscale algorithms for compression and signal/image processing are developed. Subject is project-based for engineering and scientific applications.
This class covers the analysis and modeling of stochastic processes. Topics include measure theoretic probability, martingales, filtration, and stopping theorems, elements of large deviations theory, Brownian motion and reflected Brownian motion, stochastic integration and Ito calculus and functional limit theorems. In addition, the class will go over some applications to finance theory, insurance, queueing and inventory models.
Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.