Symbolic Computation Group
David R. Cheriton School of Computer Science


Friday, September 10, 2010 at 3:30pm, at U. of Waterloo
Abstract: How many reducible polynomials are there over a finite field? How many squareful ones? Decomposable? Our census looks at such minority polynomials, both multivariate and, for decomposable ones, univariate. Exact results are usually possible but too complicated to be informative. We aim for concise statistical results with rapidly decaying relative error bounds. Joint work with Mark Giesbrecht, Alfredo Viola, and Konstantin Ziegler. This will also be part of the Tutte Symposium series.

Last modified on Sunday, 04 November 2012, at 15:42 hours.