Difference between revisions of "Math 622: Matrix Theory 2"

From MathWiki
Jump to: navigation, search
(Textbooks)
(Minimal learning outcomes)
Line 26: Line 26:
 
</div>
 
</div>
 
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.
 
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.
 +
 +
Students should learn the foundational theorems in the fields being covered. Students should learn to find and read research papers in those fields. Students should learn to solve challenging problems, develop proofs of theorems on their own, and present those proofs clearly and coherently with appropriate illustrative examples.
  
 
=== Textbooks ===
 
=== Textbooks ===

Revision as of 09:37, 1 November 2010

Catalog Information

Title

Matrix Theory 2.

Credit Hours

3

Prerequisite

Math 570. Math 621

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.

Students should learn the foundational theorems in the fields being covered. Students should learn to find and read research papers in those fields. Students should learn to solve challenging problems, develop proofs of theorems on their own, and present those proofs clearly and coherently with appropriate illustrative examples.

Textbooks

Typically the course material will come from recent research papers.

Additional topics

Courses for which this course is prerequisite