Completely Positive Matrices, Graphs with no long odd cycles and graphs with no short odd cycles
Avi Berman
TechnionIsrael Institute of Technology
February 6,
4:15pm
refreshments at 3:45pm
2338
ABSTRACT

A matrix is completely positive if it can be factored as A=BB^T where B is
elementwise nonnegative. Such matrices arise in block designs and in
statistics and are related to copositive matrices. Clearly if A is
completely positive than it is doubly nonnegative, i.e. positive semidefinite
and elementwise nonnegative. This necessary condition is not sufficient.
If A is a nonnegative symmetric matrix and its comparison matrix is an
Mmatrix than A is completely positive. This sufficient condition is not
necessary. In the talk I will describe qualitative conditions on the
matrices (in terms of odd cycles in the associated graphs) under which the
necessary condition is sufficient and the sufficient condition is
necessary. I will also discuss the smallest possible number of columns of
B in a factrization A=BB^T of a completely positive matrix.

Speaker's Contact Info: berman(atsign)techunix.technion.ac.il
Return to seminar home page
Page loaded on January 28, 2004 at 06:04 PM.

Copyright © 199899, Sara C. Billey.
All rights reserved.

