In this talk, I will discuss a direction of study in topology: Section problems. There are many variations of the problem: Nielsen realization problems, sections of a surface bundle, sections of a bundle with special property (e.g. nowhere zero vector eld). I will discuss some techniques including homology, Thurston-Nielsen classication and dynamics. Also I will share many open problems. Some of the result are joint work with Nir Gadish, Justin Lanier and Nick Salter.

For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.   A symmetric tensor decomposition can be determined by a set of generating polynomials, which can be represented by a generating matrix. Generally, a symmetric tensor decomposition can be determined by a generating matrix satisfying certain conditions. Based on them, an efficient method is given for computing symmetric tensor decompositions.