Related papers: Further results on Hilbert's Tenth Problem

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

In this paper we obtain three undecidable results for exponential diophantine equations over the field $\mathbb Q$ of rational numbers. For example, we prove that there is no algorithm to decide the solvability of a general exponential…

Let k be a field of characteristic zero, V a smooth, positive-dimensional, quasiprojective variety over k, and D a nonempty effective divisor on V. Let K be the function field of V, and A the semilocal ring of D in K. In this paper, we…

We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…

This paper presents new results in the theory of number theoretic Hilbert (NHT) transforms. New polymorphic solutions have been found for the 14-point and 16-point transforms. Several transform pairs are computed and solutions found for…

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

Quadratic eigenvalue problems (QEP) and more generally polynomial eigenvalue problems (PEP) are among the most common types of nonlinear eigenvalue problems. Both problems, especially the QEP, have extensive applications. A typical approach…

We investigate the Hurwitz existence problem from a computational viewpoint. Leveraging the symmetric-group algorithm by Zheng and building upon implementations originally developed by Baroni, we achieve a complete and non-redundant…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

We derive explicit formulas for the resultants and discriminants of classical quasi-orthogonal polynomials, as a full generalization of the results of Dilcher and Stolarsky (2005) and Gishe and Ismail (2008). We consider a certain system of…

We give the first examples of infinite sets of primes S such that Hilbert's Tenth Problem over Z[S^{-1}] has a negative answer. In fact, we can take S to be a density 1 set of primes. We show also that for some such S there is a punctured…

In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_q$, for p and q prime. We first present a classification of these groups in five classes. Then, we…

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…