Difference between revisions of "Math 622: Matrix Theory 2"
From MathWiki
(→Minimal learning outcomes) |
(→Textbooks) |
||
Line 29: | Line 29: | ||
=== Textbooks === | === Textbooks === | ||
− | |||
− | |||
− | |||
Typically the course material will come from recent research papers. | Typically the course material will come from recent research papers. | ||
Revision as of 09:36, 1 November 2010
Contents
Catalog Information
Title
Matrix Theory 2.
Credit Hours
3
Prerequisite
Description
Research topics in combinatorial matrix theory.
Desired Learning Outcomes
Prerequisites
Permission of instructor
Minimal learning outcomes
As a course directed toward research in combinatorial matrix theory. Topics are picked according to the developing interests of the research community and of faculty and student researchers. The emphasis in this course will be to develop some facility in a current research topic. Topics covered in past courses include the Colin de Verdiere parameter, the minimum rank problem for graphs, and Ramanujan graphs.
Textbooks
Typically the course material will come from recent research papers.