arXiv Analytics

Sign in

arXiv:0807.1970 [math.NT]AbstractReferencesReviewsResources

Diophantine sets of polynomials over number fields

Jeroen Demeyer

Published 2008-07-12, updated 2008-09-11Version 2

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

Comments: Previous version had a mistake in Proposition 18. This problem is avoided by working only with number fields instead of finitely generated fields of characteristic zero
Categories: math.NT, math.LO
Subjects: 11D99, 03D25, 12L12, 11R09, 12E10
Related articles: Most relevant | Search more
arXiv:0904.0967 [math.NT] (Published 2009-04-06)
On the Belyi degree(s) of a curve defined over a number field
arXiv:1904.08416 [math.NT] (Published 2019-04-17)
Hausdorff and packing dimension of Diophantine sets
arXiv:math/9811192 [math.NT] (Published 1998-11-05)
Towards regulator formulae for curves over number fields

Links

Toolbox