Related papers: A positive solution to Hilbert's 10th problem
We study the second order nonlinear differential equation \begin{equation*} u"+ \sum_{i=1}^{m} \alpha_{i} a_{i}(x)g_{i}(u) - \sum_{j=0}^{m+1} \beta_{j} b_{j}(x)k_{j}(u) = 0, \end{equation*} where $\alpha_{i},\beta_{j}>0$, $a_{i}(x),…
It is developed the theory of the boundary behavior of homeomorphic solutions of the Beltrami equations ${\bar{\partial}}f=\mu\,{\partial}f$ of the Sobolev class $W^{1,1}_{\rm loc}$ with respect to prime ends of domains. On this basis,…
In this paper we complete B\"{u}chi's proof that there is no decision algorithm for the solubility in integers of arbitrary systems of diagonal quadratic form equations, by proving the assertion that whenever $x_1^2, \cdots, x_5^2$ are five…
The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…
We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…
It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…
The Riemann hypothesis is one of the most famous unresolved problems in modern mathematics. The discussion here will present an overview of past methods that prove the Riemann hypothesis is a $\Pi_1^0$ sentence. We also end with some…
We analyze the polynomial solutions of the linear differential equation $p_2(x)y''+p_1(x)y'+p_0(x)y=0$ where $p_j(x)$ is a $j^{\rm th}$-degree polynomial. We discuss all the possible polynomial solutions and their dependence on the…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
The existence and multiplicity of positive periodic solutions for second order non-autonomous singular dynamical systems are established with superlinearity or sublinearity assumptions at infinity for an appropriately chosen parameter. Our…
In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always…
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
We study the solutions of the inverse problem \[ g(z)=\int f(y) P_T(z,dy) \] for a given $g$, where $(P_t(\cdot,\cdot))_{t \geq 0}$ is the transition function of a given Markov process, $X$, and $T$ is a fixed deterministic time, which is…
The extension of classical imperative programs with real-valued random variables and random branching gives rise to probabilistic programs. The termination problem is one of the most fundamental liveness properties for such programs. The…
We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…
We investigate the iterative methods proposed by Maz'ya and Kozlov (see [KM1], [KM2]) for solving ill-posed inverse problems modeled by partial differential equations. We consider linear evolutionary problems of elliptic, hyperbolic and…
This paper deals with Lavrentiev regularization for solving linear ill-posed problems, mostly with respect to accretive operators on Hilbert spaces. We present converse and saturation results which are an important part in regularization…