Related papers: HTP-complete rings of rational numbers
For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$,…
Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$…
For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…
One of the main open problems regarding decidability of the existential theory of rings is the analogue of Hilbert's Tenth Problem (HTP) for the ring of entire holomorphic functions in one variable. In the direction of a negative solution,…
One of the main open problems in the context of extensions of Hilbert's tenth problem (HTP) is the case of the ring of complex entire functions in one variable. Our main result provides a step towards an answer: For every $\rho\ge 0$, we…
Hilbert's Tenth Problem (HTP) asks for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has solutions over the ring $\mathbb Z$ of the integers. This was finally solved by Matiyasevich…
We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…
For all infinite rings $R$ that are finitely generated over $\mathbb{Z}$, we show that Hilbert's tenth problem has a negative answer. This is accomplished by constructing elliptic curves $E$ without rank growth in certain quadratic…
Given a complex, separable Hilbert space $\mathcal{H}$, we characterize those operators for which $\| P T (I-P) \| = \| (I-P) T P \|$ for all orthogonal projections $P$ on $\mathcal{H}$. When $\mathcal{H}$ is finite-dimensional, we also…
For a positive proportion of primes $p$ and $q$, we prove that $\mathbb{Z}$ is Diophantine in the ring of integers of $\mathbb{Q}(\sqrt[3]{p},\sqrt{-q})$. This provides a new and explicit infinite family of number fields $K$ such that…
Given a Hilbert module $H$ over a $C^*$-algebra, let $\mathcal{L}(H)$ be the set of all adjointable operators on $H$. For each $T\in\mathcal{L}(H)$, its numerical radius is defined by $w(T)=\sup\big\{\|\langle Tx, x \rangle\|: x\in H,…
We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…
We consider Hilbert's tenth problem for two families of noncommutative rings. Let $K$ be a field of characteristic $p$. We start by showing that Hilbert's tenth problem has a negative answer over the twisted polynomial ring $K\{\tau\}$ and…
In the context of Hilbert's tenth problem, an outstanding open case is that of complex entire functions in one variable. A negative solution is known for polynomials (by Denef) and for exponential polynomials of finite order (by Chompitaki,…
Let $Hilb ^{p(t)}(P^n)$ be the Hilbert scheme of closed subschemes of $P^n$ with Hilbert polynomial $p(t) \in Q[t]$, and let $W:= \overline{W(\underline{b};\underline{a};r)}$ be the closure of the locus in $Hilb ^{p(t)}(P^n)$ of…
Let $A$ be a positive bounded operator on a Hilbert space $\big(\mathcal{H}, \langle \cdot, \cdot\rangle \big)$. The semi-inner product ${\langle x, y\rangle}_A := \langle Ax, y\rangle$, $x, y\in\mathcal{H},$ induces a seminorm…
New inequalities for the numerical radius of bounded linear operators defined on a complex Hilbert space $\mathcal{H}$ are given. In particular, it is established that if $T$ is a bounded linear operator on a Hilbert space $\mathcal{H}$…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
Polynome codes and code evaluation; arithmetical theory frames; $\mu$-recursive race for decision; decision correctness; decision termination; correct termination in theory $T = PR$ of Primitive Recursion; comparison with the negative…
We prove a negative solution to the analogue of Hilbert's tenth problem for rings of one variable non-Archimedean entire functions in any characteristic. In the positive characteristic case we prove more: the ring of rational integers is…