Courses View
651. Real Variables 2.
Credit Hours:
3
Course Level:
600
Prerequisites:
MATH 551.
Catalog Description:
A development of the Lebesgue integral, function spaces and differentiation, complex measures, the Lebesgue-Radon-Nikodym theorem.
Semester Offered:
Instructor E-mail:
Comments From Graduate Director:
Continuation of Math 551. This is a basic graduate two-semester course (551/651) in real analysis. Real analysis is one of the areas of the M.S. Advanced Exams/Ph.D. entrance exams and the full-year sequence should be taken if preparing for the exam. Math 651 is recommended particularly for students intending to take the doctoral sequence in functional analysis and other doctoral-level courses in analysis and applied mathematics. However, the material is basic for anyone planning to teach upper level mathematics at the college level.
655. Complex Variables 2.
Credit Hours:
3
Course Level:
600
Prerequisites:
MATH 555.
Catalog Description:
Number systems, the complex plane and its geometry. Holomorphic functions, power series, elementary functions, complex integration, representation theorems, the calculus of residues, analytic continuation and analytic function, elliptic functions, Holomorphic functions of several complex variables.
661. Geometric Modeling-Solids.
Credit Hours:
3
Course Level:
600
Prerequisites:
MATH 561.
Catalog Description:
Mathematical techniques used in CAD/CAM environments, including basic primitives, manifold and non-manifold solids, Euler characteristic, halfspace models, constructive solid geometry (CSG), boundary representation (B-rep), Euler operators, Boolean operations, and data exchange.
671. Combinatorial Analysis 2.
Credit Hours:
3
Course Level:
600
Prerequisites:
MATH 571.
Catalog Description:
Permutations, combinations, generating functions, principle of inclusion and exclusion, distributions, partitions, compositions, trees, and networks.
677 A-Z. Topics in Discrete Mathematics.
Credit Hours:
3
Course Level:
600
Prerequisites:
MATH 571 or MATH 543 or MATH 573.
Catalog Description:
Topics may include algorithmic graph theory, combinatiorial designs, matroid theory, (0,1)-matrics, and permanents.