Bohemian Matrices

Michael Monagan, Mathematics, Simon Fraser University

Wendnesday February 26th, 1:30pm-2:20pm in AQ 5017

We consider the family of n by n Bohemian matrices over {-1,+1}, that is, n by n matrices whose entries are either -1 or +1. We have computed the number of distinct eigenvalues for n=2,3,4,5,6 using tools from Computer Algebra and we ask if it is feasible to do this for n=7.