In this talk, I am going to present the Singly Connected Vertex Deletion Problem (SCVD).

The fact that the polynomial (x1+...+xn)^d can be written as a poly(n,d)-sum of products of univariates is a consequence of what is popularly known as 'the duality trick' in the algebraic complexity circles.

Tensor are higher dimensional analogues of matrices and there is a notion of the rank of a tensor (similar to matrices).

In this talk we will give a proof of the fact that the two dimensional sphere can be partitioned into finitely many pieces in such a way that a rearrangement of the pieces produces two disjoint copies of the original sphere.

Zoom link:

An undirected graph is chordal if every cycle of length greater than three has a chord: namely, an edge connecting two nonconsecutive vertices on the cycle.  A clique of a graph $G$ is any maximal set of vertices that is complete in $G$.  Let $G$