Timeline for Number of unique determinants for an NxN (0,1)-matrix
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2010 at 3:37 | comment | added | Will Orrick | Interestingly, the problem was studied by Metropolis, Stein, and Wells (see N. Metropolis. Spectra of determinant values in (0, 1) matrices. In A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory: Proceedings of the Science Research Atlas Symposium No. 2 held at Oxford, from 18-23 August, 1969, pages 271–276, London, 1971. Academic Press.) who had computed the answers up to n=7 back in 1969 (and claimed to be able to handle n=8). I wasn't aware of this work when I wrote the aforementioned paper. | |
| Mar 18, 2010 at 7:08 | comment | added | Gerhard Paseman | I am also interested in applications. I may be induced to help you with your application. Gerhard "Ask Me About System Design" Paseman, 2010.03.19 | |
| Mar 18, 2010 at 7:04 | comment | added | Gerhard Paseman | This subject is a current research interest of mine. Orrick maintains a web site which contains conjectured determinant spectra, Miodrag Zivkovic has done exhaustive reseearch involving Smith Normal forms up to 9x9, and I am searching for another class of matrices to push the bound above 4 times the nth Fibonacci number. A search for "Paseman determinant" will give you some of the internet links. Post more questions here and I will share what I know and believe. Gerhard "Ask Me About System Design" Paseman, 2010.03.19 | |
| Mar 18, 2010 at 6:40 | history | answered | Gerry Myerson | CC BY-SA 2.5 |