Related papers: Hilbert's Tenth Problem: Refinements and Variants
We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.
Consider in a real Hilbert space $H$ the differential equation (inclusion) $(E)$: $p(t)u^{\prime \prime}(t)+q(t)u^{\prime}(t)\in Au(t)+f(t)$ for a.a. $t>0$, with the condition $(B)$: $u(0)=x \in \overline{D(A)}$, where $A\colon D(A)\subset…
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent…
We prove a non-commutative version of the Hilbert's 17th problem, giving a characterization of the class of non-commutative polynomials in n-undeterminates that have positive trace when evaluated in n-selfadjoint elements in arbitrary II1…
We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational…
Learning processes are useful methodologies able to improve knowledge of real phenomena. These are often dependent on hyperparameters, variables set before the training process and regulating the learning procedure. Hyperparameters…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown…
We study irreducible specializations, in particular when group-preserving specializations may not exist. We obtain a criterion in terms of embedding problems. We include several applications to analogs of Schinzel's hypothesis H and to the…
Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smory\'nski's theorem states that the set of all Diophantine equations which have at most…
Based on the MRDP theorem concerning the Hilbert tenth problem, there is a corresponding Diophantine equation called proof equation for every formula of the First-order Peano Arithmetic (PA). A formula is provable in PA, if and only if the…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…
Using the technique of formative processes, I solve the decidability problem of MLS with unordered cartesian product in the positive. Moreover I give a pure combinatorial description of the satisfiable MLS with unordered cartesian…
We study the analogue of the infinitesimal 16th Hilbert problem in dimension zero. Lower and upper bounds for the number of the zeros of the corresponding Abelian integrals (which are algebraic functions) are found. We study the relation…
The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >=…