Results 1  10
of
12
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers
"... Let F be their rings of integers. If there exists an elliptic curve E over F such that rk E(F ) = rk E(K) = 1, then there exists a diophantine definition of . ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Let F be their rings of integers. If there exists an elliptic curve E over F such that rk E(F ) = rk E(K) = 1, then there exists a diophantine definition of .
DEFINING INTEGRALITY AT PRIME SETS OF HIGH DENSITY IN NUMBER FIELDS
 VOL. 101, NO. 1 DUKE MATHEMATICAL JOURNAL
, 2000
"... ..."
Hilbert’s Tenth Problem for algebraic function fields of characteristic 2
 Pacific J. Math
, 2003
"... Let K be an algebraic function field of characteristic 2 with constant field CK. Let C be the algebraic closure of a finite field in K. Assume that C has an extension of degree 2. Assume that there are elements u, x of K with u transcendental over CK and x algebraic over C(u) and such that K = CK(u, ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Let K be an algebraic function field of characteristic 2 with constant field CK. Let C be the algebraic closure of a finite field in K. Assume that C has an extension of degree 2. Assume that there are elements u, x of K with u transcendental over CK and x algebraic over C(u) and such that K = CK(u, x). Then Hilbert’s Tenth Problem over K is undecidable. Together with Shlapentokh’s result for odd characteristic this implies that Hilbert’s Tenth Problem for any such field K of finite characteristic is undecidable. In particular, Hilbert’s Tenth Problem for any algebraic function field with finite constant field is undecidable. 1. Introduction. Hilbert’s Tenth Problem in its original form can be stated in the following form: Is there a uniform algorithm that determines, given a polynomial equation with integer coefficients, whether the equation has an integer solution
HILBERT’S TENTH PROBLEM FOR FUNCTION FIELDS OF VARIETIES OVER NUMBER FIELDS AND pADIC
, 2006
"... Let k be a subfield of a padic field of odd residue characteristic, and let L be the function field of a variety of dimension n ≥ 1 over k. Then Hilbert’s Tenth Problem for L is undecidable. In particular, Hilbert’s Tenth Problem for function fields of varieties over number fields of dimension ≥ 1 ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Let k be a subfield of a padic field of odd residue characteristic, and let L be the function field of a variety of dimension n ≥ 1 over k. Then Hilbert’s Tenth Problem for L is undecidable. In particular, Hilbert’s Tenth Problem for function fields of varieties over number fields of dimension ≥ 1 is undecidable.
Diophantine Undecidability of Function Fields of Characteristic Greater Than 2, Finitely Generated over Fields Algebraic over a Finite Field
, 2001
"... Let F be a function field of characteristic p>2, finitely generated over a field C algebraic over a finite field Cp and such that it has an extension of degree p. Then Hilbert's Tenth Problem is not decidable over F . 1 ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Let F be a function field of characteristic p>2, finitely generated over a field C algebraic over a finite field Cp and such that it has an extension of degree p. Then Hilbert's Tenth Problem is not decidable over F . 1
INTEGRALITY AT A PRIME FOR GLOBAL FIELDS AND THE PERFECT CLOSURE OF GLOBAL FIELDS OF CHARACTERISTIC p > 2
, 2006
"... Let k be a global field and p any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at p is diophantine over k. Let k perf be the perfect closure of a global field of characteristic p> 2. We also prove that the set ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let k be a global field and p any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at p is diophantine over k. Let k perf be the perfect closure of a global field of characteristic p> 2. We also prove that the set of all elements of k perf which are integral at some prime q of k perf is diophantine over k perf, and this is the first such result for a field which is not finitely generated over its constant field. This is related to Hilbert’s Tenth Problem because for global fields k of positive characteristic, giving a diophantine definition of the set of elements that are integral at a prime is one of two steps needed to prove that Hilbert’s Tenth Problem for k is undecidable.
Extensions of Büchi’s problem: questions of decidability for addition and kth
, 2005
"... Abstract. We generalize a question of Büchi: Let R be an integral domain and k ≥ 2 an integer. Is there an algorithm to solve in R any given system of polynomial equations, each of which is linear in the k−th powers of the unknowns? We examine variances of this problem for k = 2, 3 and for R a field ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We generalize a question of Büchi: Let R be an integral domain and k ≥ 2 an integer. Is there an algorithm to solve in R any given system of polynomial equations, each of which is linear in the k−th powers of the unknowns? We examine variances of this problem for k = 2, 3 and for R a field of rational functions of characteristic zero. We obtain negative answers, provided that the analogous problem over Z has a negative answer. In particular we prove that the generalization of Büchi’s question for fields of rational functions over a realclosed field F, for k = 2, has a negative answer if the analogous question over Z has a negative answer. 1
Hilbert's Tenth Problem over Rings of NumberTheoretic Interest
, 2003
"... This article is a survey about analogues of Hilbert's Tenth Problem over various rings, especially rings of interest to number theorists and algebraic geometers. For more details about most of the topics considered here, the conference proceedings [DLPVG00] is recommended. 2. The original problem H ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This article is a survey about analogues of Hilbert's Tenth Problem over various rings, especially rings of interest to number theorists and algebraic geometers. For more details about most of the topics considered here, the conference proceedings [DLPVG00] is recommended. 2. The original problem Hilbert's Tenth Problem (from his list of 23 problems published in 1900) asked for an algorithm to decide whether a diophantine equation has a solution. More precisely, the input and output of such an algorithm were to be as follows: input: a polynomial f(x 1 , . . . , x n ) having coe#cients in Z Date: February 28, 2003
AUTOMORPHISMS MAPPING A POINT INTO A SUBVARIETY
"... Abstract. The problem of deciding, given a complex variety X, a point x ∈ X, and a subvariety Z ⊆ X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert’s tenth problem for systems of polynomials over Z defi ..."
Abstract
 Add to MetaCart
Abstract. The problem of deciding, given a complex variety X, a point x ∈ X, and a subvariety Z ⊆ X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert’s tenth problem for systems of polynomials over Z defining an affine Qvariety whose projective closure is smooth. 1.
UNDECIDABLE PROBLEMS: A SAMPLER
"... Abstract. After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics. 1. Two notions of undecidability There are two common settings in which one speaks of undecidability: 1. Independence ..."
Abstract
 Add to MetaCart
Abstract. After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics. 1. Two notions of undecidability There are two common settings in which one speaks of undecidability: 1. Independence from axioms: A single statement is called undecidable if neither it nor its negation can be deduced using the rules of logic from the set of axioms being used. (Example: The continuum hypothesis, that there is no cardinal number strictly between ℵ0 and 2 ℵ0, is undecidable in the ZFC axiom system, assuming that ZFC itself is consistent [Göd40, Coh63, Coh64].) The first examples of statements independent of a “natural ” axiom system were constructed by K. Gödel [Göd31]. 2. Decision problem: A family of problems with YES/NO answers is called undecidable if there is no algorithm that terminates with the correct answer for every problem in the family. (Example: Hilbert’s tenth problem, to decide whether a multivariable polynomial equation with integer coefficients has a solution in integers, is undecidable [Mat70].) Remark 1.1. In modern literature, the word “undecidability ” is used more commonly in sense 2, given that “independence ” adequately describes sense 1. To make 2 precise, one needs a formal notion of algorithm. Such notions were introduced by A. Church [Chu36a] and A. Turing [Tur36] independently in the 1930s. From now on, we interpret algorithm to mean Turing machine, which, loosely speaking, means that it is a computer program that takes as input a finite string of 0s and 1s. The role of the finite string is to specify which problem in the family is to be solved. Remark 1.2. Often in describing a family of problems, it is more convenient to use higherlevel mathematical objects such as polynomials or finite simplicial complexes as input. This is acceptable if these objects can be encoded as finite binary strings. It is not necessary to specify the encoding as long as it is clear that a Turing machine could convert between reasonable encodings imagined by two different readers.