MATH 678 - Combinatorial Analysis and Graph Theory

Institution:

University of Pennsylvania

Subject:

Description:

Staff. Generating functions, enumeration methods, Polya's theorem, combinatorial designs, discrete probability, extremal graphs, graph algorithms and spectral graph theory, combinatorial and computational geometry. Applied Linear Analysis. (M) Staff. Prerequisite(s): Math 241 and one semester of: Math 360/361 or Math 508/509. Application of techniques from linear algebra to real problems in economics, engineering, physics, etc. and the difficulties involved in their implementation. Particular emphasis is placed on solving equations, the eigenvalue problem for symmetric matrices and the metric geometry of spaces of matrices. Applications to problems such as options pricing, image reconstruction, airplane and ship design, oil prospecting, etc. (these topics will vary from year to year). Analysis of the numerical algorithms available to solve such problems, rates of convergence, accuracy and stability. Applied Linear Analysis. (M) Staff. Prerequisite(s): Math 680 or with the permission of the instructor. Continuation of Math 680.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.upenn.edu

Phone Number:

(215) 898-5000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.