Math 622: Matrix Theory 2 - Revision history

Ls5: moved Math 622 to Math 622: Matrix Theory 2

2013-04-03T22:43:44Z

2010-11-01T15:37:42Z

‎Minimal learning outcomes

2010-11-01T15:36:18Z

‎Textbooks

2010-11-01T15:36:01Z

‎Minimal learning outcomes

2010-11-01T15:34:42Z

‎Prerequisites

2010-10-31T04:51:29Z

‎Textbooks

2010-10-31T04:50:37Z

‎Minimal learning outcomes

2010-10-31T04:46:44Z

‎Prerequisite

2010-07-28T16:33:45Z

‎Minimal learning outcomes

2009-06-04T19:06:50Z

@@ Line 26: / Line 26: @@
 </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.
 === Textbooks ===

← Older revision		Revision as of 15:36, 1 November 2010
Line 29:		Line 29:
	=== Textbooks ===		=== Textbooks ===

−	~~Possible textbooks for this course include (but are not limited to):~~
−
−	*
	Typically the course material will come from recent research papers.		Typically the course material will come from recent research papers.

@@ Line 25: / Line 25: @@
 </div>
-As a course directed toward research in combinatorial matrix theory, 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.
 === Textbooks ===

← Older revision		Revision as of 04:51, 31 October 2010
Line 30:		Line 30:

	*		*
		+	Typically the course material will come from recent research papers.

	=== Additional topics ===		=== Additional topics ===

← Older revision	Revision as of 22:43, 3 April 2013
(No difference)

← Older revision		Revision as of 04:50, 31 October 2010
Line 23:		Line 23:

	</div>		</div>
		+	As a course directed toward research in combinatorial matrix theory, 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 ===		=== Textbooks ===

@@ Line 9: / Line 9: @@
 === Prerequisite ===
 [[Math 570]].
 === Description ===

← Older revision		Revision as of 16:33, 28 July 2010
Line 22:		Line 22:

	</div>		</div>
		+	=== Textbooks ===
		+
		+	Possible textbooks for this course include (but are not limited to):
		+
		+	*

	=== Additional topics ===		=== Additional topics ===

@@ Line 2: / Line 2: @@
 === Title ===
-Matrix Theory.
+Matrix Theory 2.
 === Credit Hours ===
@@ Line 11: / Line 11: @@
 === Description ===
-Zero-one matrices, spectra of graphs, Laplacian matrix, irreducible
+Research topics in combinatorial matrix theory.
-and primitive matrices, cycle expansion of the determinant, matrix completion problems, permanents, generalized matrix functions.
 == Desired Learning Outcomes ==