Total Positivity of Matrices: Two Combinatorial Approaches

Tom Carlile

Monday, March 22, 2004
11:00 am, 945 Patterson Office Tower
NOTE TIME AND PLACE!!

Abstract:

A matrix is totally positive if the determinant of any square submatrix is positive. I will present and elucidate two methods used in a paper by Fomin and Zelevinsky to characterize and develop a test for totally positive square matrices. Planar networks are graphs with n sources and n sinks with a particular form that will be presented. Double-wiring diagrams will be explained and used as well.