#### IMSc Webinar

#### Complexity of Polynomial Division and Power Series Truncation

#### Anurag Pandey

##### Saarbrucken, Germany

*zoom.us/j/99018916192?pwd=WE9IbmkrTlk5M20zZTRuVEpndlg3QT09*

Meeting ID: 990 1891 6192

Passcode: 9Tv6Ej

In this talk, we discuss the arithmetic complexity of polynomial division. That is, we try to understand the arithmetic circuit complexity of a polynomial f := g/h in terms of the complexity of polynomials g and h. Secondly, we discuss the arithmetic circuit complexity of truncations of power series of rational functions, algebraic functions, and transcendental functions. The truncations of power series allow us to compute number sequences emerging in enumerative combinatorics like Fibonacci numbers, Catalan numbers, and Bell numbers, and also facilitate approximations of several irrational and transcendental numbers of interest like e and pi.

Done