Symbolic Computation Group
David R. Cheriton School of Computer Science


March 11, 2011 at 1:30pm, at U. of Western Ontario
Abstract: A hyperplane arrangement is a finite union of hyperplanes in a vector space. Arrangements, and some straightforward constructions performed on them, produce topological spaces, I will give an informal introduction to some of these constructions by means of computational examples. Together with Greg Smith, I have developed an addon package to Grayson and Stillman's symbolic algebra system Macaulay 2 for the purpose of computing with hyperplane arrangements. I will demonstrate some of its features and try to show how computer algebra can be (very) useful in the research I do.

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