We introduce some effective computation of tensor rank and tensor decomposition through apolarity and nonabelian apolarity, with some examples described in detail. The first lecture regards the symmetric case, where symmetric tensors are identified with homogeneous polynomials. The second lecture regards the general case.

We introduce some effective computation of tensor rank and tensor decomposition through apolarity and nonabelian apolarity, with some examples described in detail. The first lecture regards the symmetric case, where symmetric tensors are identified with homogeneous polynomials. The second lecture regards the general case.