Binary Determinantal Complexity



My good friend and colleague Christian Ikenmeyer and I <a href="http://arxiv.org/abs/1410.8202" target="_blank">wrote this cute preprint</a> about polynomials and how they can be written as the determinant of a matrix with entries equal to zero, one and indeterminantes. Go ahead and read it if you know even just a little math, it's quite straightforward. The algorithm described in section 3 has been implemented and you can download the code <a href="http://page.math.tu-berlin.de/~jesko/code/ptest.zip" target="_blank">from my website at the TU Berlin</a>. Compilation instructions are in `ptest.c`, but you will need to get <a href="http://cs.anu.edu.au/~bdm/nauty/" target="_blank">nauty</a> to perform the entire computerized proof.

Leave a Reply

Your email address will not be published. Required fields are marked *