Timeline for Integer matrices with no integer eigenvalues
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2010 at 3:08 | comment | added | user6976 | @Hej: As you can see even for products like $A^nB^m$ the problem is equivalent to solvability of certain exponential Diophantine equation. So the problem is not easy. As far as I know, this is not the kind of problems for which one can prove independence from PA by existing methods. In any case, you should modify the question replacing "undecidability" by "unprovability in PA". These are completely different questions. | |
| Nov 12, 2010 at 3:03 | history | edited | user6976 | CC BY-SA 2.5 |
added 157 characters in body
|
| Nov 12, 2010 at 3:00 | comment | added | Hej | @ Mark. What I was worried about is that the problem would be unprovable in the Peano arithmetic but the problem of whether there is an algorithm that can determine whether a seimgroup generated by two input matrices contains a matrix with integer eigenvalues is interesting on its own. | |
| Nov 12, 2010 at 2:24 | history | answered | user6976 | CC BY-SA 2.5 |