Seminar • Symbolic Computation • On the Rank of Polynomial Multiplication over Rings

Friday, November 20, 2026 12:30 pm - 1:30 pm EST (GMT -05:00)

Please note: This seminar will take place in DC 1304 and online.

Éric Schost, Professor
David R. Cheriton School of Computer Science

In the analysis of algorithms to multiply polynomials, one may count the total number of operations that are done, or only the “essential” bilinear multiplications: the latter quantity is called the rank of the algorithm. Algorithms with linear rank exist over all fields, even finite ones: this is a celebrated result due to Chudnovsky and Chudnovsky, based on the arithmetic properties of modular curves. I will present a proof by chatGPT that this remains true over the integers, and thus over any ring, by means of a lift to characteristic zero of Chudnovsky and Chudnovsky’s construction.


To attend this seminar in person, please go to DC 1304. You can also attend virtually on Zoom.