Graphs are a prime object in combinatorics, and tensors appear naturally in linear algebra and geometry. Some recent works reveal intriguing connections between graphs and tensors, the first of which trace back to the works of Tutte and Lovász. In this talk we will present some such connections, and how these connections lead to results in quantum information, computational complexity, cryptography, invariant theory, and group theory.

报告人简介：Youming Qiao graduated from Tsinghua University in 2012; his supervisors were Andrew Yao and László Babai. Subsequently, he was a postdoctoral researcher at the National University of Singapore, hosted by Miklos Santha. He then joined the University of Technology Sydney, and is now an associate professor there. Youming is interested in computational complexity and algebraic computation. Some specific problems he has worked on include polynomial identity testing and isomorphism problems of algebraic structures.