English
Related papers

Related papers: Decidability of the HD0L ultimate periodicity prob…

200 papers

In this paper, we study the existence and uniqueness of periodic solutions of the differential equation of the form . Here, we obtain some sufficient conditions which guarantee the existence of periodic solutions. This equation is a quite…

Classical Analysis and ODEs · Mathematics 2011-08-23 Muzaffer Ates

We proof a uniqueness and periodicity theorem for bounded solutions of uniformly elliptic equations in certain unbounded domains.

Analysis of PDEs · Mathematics 2007-11-21 Matthias Bergner , Jens Dittrich

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

Logic · Mathematics 2019-02-20 Mikołaj Bojanczyk , Stanisław Szawiel , Marek Zawadowski

In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…

Logic · Mathematics 2015-09-25 Grigoriy V. Bokov

The article studies the reiterated homogenization of linear elliptic variational inequalities arising in problems with unilateral constrains. We assume that the coefficients of the equations satisfy and abstract hypothesis covering on each…

Mathematical Physics · Physics 2018-11-16 Hermann Douanla , Cyrille Kenne

In this paper, we construct a periodic dichotomy transformation using solutions of periodic Riccati and Lyapunov equations. As an application of this transformation, we provide an explicit representation of the optimal extremal for periodic…

Optimization and Control · Mathematics 2026-04-07 Shichao Ye , Xingwu Zeng , Can Zhang

This work is devoted to the study of the existence and periodicity of solutions of initial differential problems, paying special attention to the explicit computation of the period. These problems are also connected with some particular…

Classical Analysis and ODEs · Mathematics 2014-11-21 Alberto Cabada , F. Adrián F. Tojo

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

Logic in Computer Science · Computer Science 2023-07-28 Fabian Mitterwallner , Aart Middeldorp , René Thiemann

In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language $b\{0,1\}^*c$. The proof is based on the works of Leonid P. Lisovik.

Formal Languages and Automata Theory · Computer Science 2021-12-01 Vesa Halava

In this paper, we provide a necessary and sufficient condition ensuring the property of exponential dichotomy for periodic linear systems of generalized differential equations. This condition allow us to revisit a recent result of…

Classical Analysis and ODEs · Mathematics 2022-08-26 Claudio A. Gallegos , Gonzalo Robledo

In this paper, we study the existence of infinitely many periodic solutions for second order Hamiltonian systems $\ddot{u}+\nabla_u V(t,u)=0$, where $V(t, u)$ is either asymptotically quadratic or superquadratic as $|u|\to \infty$.

Dynamical Systems · Mathematics 2011-06-03 Qingye Zhang , Chungen Liu

Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by…

Logic in Computer Science · Computer Science 2025-01-15 Marie Fortin , Louwe B. Kuijer , Patrick Totzke , Martin Zimmermann

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of…

Databases · Computer Science 2016-06-03 Xiaowang Zhang , Jan Van den Bussche , François Picalausa

In this paper we improve the approach of a previous paper about the domino problem in the hyperbolic plane, see arXiv.cs.CG/0603093. This time, we prove that the general problem of the hyperbolic plane with \`a la Wang tiles is undecidable.

Computational Geometry · Computer Science 2007-05-23 Margenstern Maurice

In the present paper we derive Liouville type results and existence of periodic solutions for $\chi^{(2)}$ type systems with non-homogeneous nonlinearities. Moreover, we prove both universal bounds as well as singularity and decay estimates…

Analysis of PDEs · Mathematics 2023-06-27 Aleks Jevnikar , Jun Wang , Wen Yang

In this paper we are concerned with the stability of equilibrium solutions of periodic Hamiltonian systems with one degree of freedom in the case of degeneracy, which means that the characteristic exponents of the linearized system have…

Dynamical Systems · Mathematics 2017-05-31 Nina Xue , Xiong Li

We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.

Mathematical Physics · Physics 2007-05-23 Paolo Amore , Hakan Ciftci , Francisco M. Fernandez

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Combinatorics · Mathematics 2012-09-03 Fabien Durand

In this paper is provided a new representation of periodic solution to the impulsive Logistic equation considered in [7].

General Mathematics · Mathematics 2014-03-31 Gyong-Chol Kim , Hyong-Chol O , Sang-Mun Kim , Chol Kim