Hansel's lemma (not Hensel's lemma) states that if the complete graph on $n$ vertices can be expressed as the union of $r$ bipartite graphs $B_1,B_2,\ldots,B_r$ such that $n_i$ is the number of non-isolated vertices in $B_i$, then $n_1+n_2+\cdots+

Origami is the art of paper folding. It can also be described mathematically with a set of seven axioms, which are complete. In this talk, we will see the following.

In this talk we will discuss a topological proof of the fundamental theorem of algebra which states that any non-constant polynomial over the field of complex numbers has a complex root.

In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.