Related papers: Hilbert's Tenth Problem: Refinements and Variants

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

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…

Existence, uniqueness and stability of the solutions of linear stochastic evolution equations are investigated. The results obtained are used to prove theorems on solvability of linear second order stochastic partial differential equations…

The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…

We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.

We describe the eventual behaviour of the Hilbert function of a set of distinct points in P^{n_1} x ... x P^{n_k}. As a consequence of this result, we show that the Hilbert function of a set of points in P^{n_1} x ... x P^{n_k} can be…

In this paper, we introduce a system of split variational inequality problems in real Hilbert spaces. Using projection method, we propose an iterative algorithm for the system of split variational inequality problems. Further, we prove that…

For a given natural number $n$, the second part of Hilbert's 16th Problem asks whether there exists a finite upper bound for the maximum number of limit cycles that planar polynomial vector fields of degree $n$ can have. This maximum number…

In this paper, we propose new algorithms for finding a common point of the solution set of a pseudomonotone equilibrium problem and the set of fixed points of a symmetric generalized hybrid mapping in a real Hilbert space. The convergence…

Given a pattern $p = s_1x_1s_2x_2\cdots s_{r-1}x_{r-1}s_r$ such that $x_1,x_2,\ldots,x_{r-1}\in\{x,\overset{{}_{\leftarrow}}{x}\}$, where $x$ is a variable and $\overset{{}_{\leftarrow}}{x}$ its reversal, and $s_1,s_2,\ldots,s_r$ are…

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

A stochastic differential equation with coefficients defined in a scale of Hilbert spaces is considered. The existence, uniqueness and path-continuity of infinite-time solutions is proved by an extension of the Ovsyannikov method. This…

Theoretical and computational properties of a vector equation $Ax-\|x\|_1x=b$ are investigated, where $A$ is an invertible $M$-matrix and $b$ is a nonnegative vector. Existence and uniqueness of a nonnegative solution is proved. Fixed-point…

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…

We refine the formulation of the Boolean satisfiability problem with $n$ Boolean variables in Clifford algebra ${\cal C}\ell(\mathbb{R}^{n,n})$ [3] and exploit this continuous setting to outline a new unsatisfiability test. This algorithm…

We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…