Related papers: Decidability of the HD0L ultimate periodicity prob…

We provide sufficient conditions for the existence of periodic solutions of the planar perturbed double pendulum with small oscillations.

We establish the best (minimum) constant for Ulam stability of first-order linear $h$-difference equations with a periodic coefficient. First, we show Ulam stability and find the Ulam stability constant for a first-order linear equation…

The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…

Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…

In this paper, we generalized the known Laplace-transform final-value theorem. From our conclusion, one can deduce the existing results in [1, 3, 12]. By using final value theorem, we give a new proof that Caputo fractional differential…

A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

We prove for the $N$-body problem the existence of hyperbolic motions for any prescribed limit shape and any given initial configuration of the bodies. The energy level $h>0$ of the motion can also be chosen arbitrarily. Our approach is…

In previous publications, we illustrated the effectiveness of the method of the inhomogeneous differential equation in calculating the electric polarizability in the one-dimensional problem. In this paper we extend our effort to apply the…

We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

In this paper, the complex version KdV equation is discussed. The corresponding coupled equations is a integrable system in the sense of the bi-Hamiltonian structure, so the complex version KdV equation is integrable. A new spectral form is…

This paper deals with the \emph{integral} version of the Dirichlet homogeneous fractional Laplace equation. For this problem weighted and fractional Sobolev a priori estimates are provided in terms of the H\"older regularity of the data. By…

We give an arithmetic proof of rigidity for postcritically finite polynomials.

In this paper we study the conditions, under which the quaternionic Riccati equations have periodic solutions. The obtained result we compare with one recently obtained important one.

We provide a definitive classification of all finite sets of regular polygons that admit a tiling of the hyperbolic plane, thereby establishing the decidability of the Domino Problem for this class of prototiles. We show that admissibility…

We prove Koll\'{a}r conjecture for weighted homogeneous surface singularities with big central node. More precisely, we show that every irreducible component of the deformation space of the singularity is parametrized by a certain partial…

The decidability of a logical system refers to the existence of an algorithm that can determine whether any given formula in that system is a theorem. In this paper, Harrop's lemma is used to prove the decidability of quantum modal logic.

This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from $1\frac{1}{2}$-player games with PCTL winning objectives, we establish that the PCTL satisfiability problem is…

In this article we prove a reducibility result for the linear Schr\"odinger equation on a Zoll manifold with quasi-periodic in time pseudo-differential perturbation of order less or equal than $1/2$. As far as we know, this is the first…