4
$\begingroup$

By Matiyasevich's theorem, each member of computably enumerable set can be obtain from a diophantine equation system. For prime numbers, this system of diophantine equation is found. My question is:

For special computably enumerable set as like as perfect numbers, how can we construct this diophantine equation system?

Is there Matiyasevich's type theorem for the matrix algebra?

Improve this question
$\endgroup$

1 Answer 1

Reset to default
6
$\begingroup$

For Diophantine representations of perfect numbers, you may read V.Y. Kryauchyukas, Diophantine representation of perfect numbers.

For James Jones' Diophantine representations of Mersenne primes and Fermat primes, see http://matwbn.icm.edu.pl/ksiazki/aa/aa35/aa3531.pdf

For universal Diophantine equation, please consult Jones' paper of that name in J. Symbolic Logic 47 (1982), 549–571, doi:10.2307/2273588, also available from https://www.jstor.org/stable/2273588.

Jones' paper in 1982 contains a general method to transform any polynomial Diophantine equation over $\mathbb N=\{0,1,\ldots\}$ to one with at most 9 natural number unknowns.

Improve this answer
$\endgroup$
1
  • $\begingroup$ Thanks for your answer. Is there such semi results for matrix algebra? For example, is there diophantine representation of all permutation matrices or determinant $\pm{1}$ matrices? $\endgroup$
    – Shahrooz
    Commented Dec 2, 2018 at 7:07

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .