报告主题：Completely Positive Binary Tensors
报告人：范金燕 教授 （ 上海交通大学）
报告时间：2019年7月1日（周一）16:00
报告地点：校本部GJ410
邀请人：周安娃
主办部门：太阳成集团tyc33455数学系
报告摘要：A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. In this talk, we characterize completely positive binary tensors. We show that a binary tensor is completely positive if and only if it satisfies two linear matrix inequalities. This result can be used to determine whether a binary tensor is completely positive or not. When it is, we give an algorithm for computing its cp-rank and the decomposition. When the order is odd, we show that the cp-rank decomposition is unique. When the order is even, we completely characterize when the cp-rank decomposition is unique.
欢迎教师、员工参加！
