|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
(231) Either semester. Three credits. Prerequisite: MATH 2110, 2130 or 2143 which may be taken concurrently with the consent of the instructor. Introduction to the theory of probability. Discussion of some of the probability problems encountered in scientific and business fields.
-
3.00 Credits
(232) (Also offered as STAT 3965.) Either semester. Three credits. Prerequisite: STAT 3025 or 3345 or 3375 or MATH 3160. Conditional distributions, discrete and continuous time Markov chains, limit theorems for Markov chains, random walks, Poisson processes, compound and marked Poisson processes, and Brownian motion. Selected applications from actuarial science, biology, engineering, or finance.
-
3.00 Credits
(215) Either semester. Alternate years. Three credits. Prerequisite: MATH 2210 or 2144; and MATH 2710. Vector spaces and linear transformations over fields.
-
3.00 Credits
(216) Either semester. Three credits. Prerequisite: MATH 2710 or 2142. Recommended preparation: MATH 2210 or 2144. An introduction to group theory and ring theory.
-
3.00 Credits
(217) Either semester. Three credits. Prerequisite: MATH 3230. Recommended preparation: MATH 3210. Topics from ring theory, Galois theory, linear and multilinear algebra, or algebraic geometry.
-
3.00 Credits
(258) Either semester. Three credits. Prerequisite: MATH 2142 or 2710. Euclid's algorithm, modular arithmetic, Diophantine equations, analogies between integers and polynomials, and quadratic reciprocity, with emphasis on developing both conjectures and their proofs.
-
3.00 Credits
(251) Either semester. Three credits. Prerequisite: MATH 2142 or 2710. Analysis of combinatorial problems and solution methods. Topics include: Enumeration, generating functions, bijective proofs, sieve methods, recurrence relations, graphs, partially ordered sets, and extremal combinatorics.
-
3.00 Credits
(235) Either semester, alternate years. Three credits. Prerequisite: MATH 2710 or 2142 or CSE 207. PHIL 2211 is recommended. Formalization of mathematical theories, elementary model theory with applications to algebra, number theory, and non-standard analysis. Additional topics: Elementary recursion theory and axiomatic set theory. Emphasis on the applications of logic to mathematics rather than the philosophical foundations of logic.
-
3.00 Credits
(237) Either semester, alternate years. Three credits. Prerequisite: MATH 2710 or 2142 or CSE 2500. Finite automata and regular languages, pushdown automata and context-free languages and grammars. Turing machines, recursively enumerable sets and grammars, Church's thesis, the halting problem, and other undecidable problems. Computational complexity and NP-completeness.
-
3.00 Credits
(250) Either semester, alternate years. Three credits. Prerequisite: MATH 2142 or 2710. Metric spaces, topological spaces and functions, topological properties, surfaces, elementary topics in geometric topology.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|