Matrix Equations and Hilbert's Tenth Problem
نویسندگان
چکیده
We show a reduction of Hilbert’s tenth problem to the solvability of the matrix equation A1 1 A i2 2 · · ·A ik k = Z over non-commuting integral matrices, where Z is the zero matrix, thus proving that the solvability of the equation is undecidable. This is in contrast to the case whereby the matrix semigroup is commutative in which the solvability of the same equation was shown to be decidable in general. We also show that the solvability of the matrix equation AB = C for matrices A,B,C ∈ Q is decidable in polynomial time by converting the problem to the orbit problem.
منابع مشابه
Divisibility Sequences and Hilbert ’ S Tenth Problem Graham
Following ideas of Poonen, we use elliptic divisibility sequences to construct two subrings of the field of rational numbers, which generate the field, and for which Hilbert's Tenth Problem is undecidable. In 1970, Matijasevi˘ c [19], building upon earlier work of Davies, Put-nam and Robinson [6], resolved negatively Hilbert's Tenth Problem for the ring Z, of rational integers. This means there...
متن کامل1 3 Ju l 2 00 7 ELLIPTIC DIVISIBILITY SEQUENCES AND HILBERT ’ S TENTH PROBLEM
Following ideas of Poonen, we use elliptic divisibility sequences to construct two subrings of the field of rational numbers, which generate the field, and for which Hilbert's Tenth Problem is undecidable. In 1970, Matijasevi˘ c [19], building upon earlier work of Davies, Put-nam and Robinson [6], resolved negatively Hilbert's Tenth Problem for the ring Z, of rational integers. This means there...
متن کامل7 Elliptic Curves and Hilbert ’ S Tenth Problem Graham
Following ideas of Poonen, we use elliptic divisibility sequences to construct two subrings of the field of rational numbers , whose compositum is the field, and for which Hilbert's Tenth Problem is undecidable. In 1970, Matijasevic [17], building upon earlier work of Davies, Put-nam and Robinson [5], resolved negatively Hilbert's Tenth Problem (hereafter Hilbert10) for the ring Z, of rational ...
متن کاملUndecidable Diophantine Equations
In 1900 Hubert asked for an algorithm to decide the solvability of all diophantine equations, P(x1, . . . , xv) = 0, where P is a polynomial with integer coefficients. In special cases of Hilbert's tenth problem, such algorithms are known. Siegel [7] gives an algorithm for all polynomials P(xx, . . . , xv) of degree < 2. From the work of A. Baker [1] we know that there is also a decision proced...
متن کاملA reformulation of Hilbert’s tenth problem through Quantum Mechanics
Inspired by Quantum Mechanics, we reformulate Hilbert’s tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shrödinger propagator with some appropriate kernel. Either way, Mathematics and Physics could be combined for Hilbert’s tenth problem and for the notion of effective computability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 18 شماره
صفحات -
تاریخ انتشار 2008