| Title | : | Some new closure results and deterministic algorithms for polynomial factorisation |
| Speaker | : | Mrinal Kumar (TIFR Mumbai) |
| Details | : | Tue, Oct 14, 2025 3:30 PM, @ SSB 334 (Turing Hall) |
| Abstract | : | The research on computational aspects of polynomial factorisation has traditionally focused on two primary questions: (1) Closure results - if a multivariate polynomial is efficiently computable (in any natural algebraic model of computation), are its factors also efficiently computable ? and (2) Efficient algorithms - can we design efficient algorithms for multivariate polynomial factorisation ? While remarkable progress was made on these problems in the 1980s due to the work of Kaltofen, some natural questions remained open. In this talk, we will discuss some of these questions and some recent progress towards their understanding. Based on joint works with S. Bhattacharjee, S. Rai, V. Ramanathan, R. Saptharishi and S. Saraf |