Related papers: Decidability of the HD0L ultimate periodicity prob…

We prove that the theory of all modules over the ring of algebraic integers is decidable.

It is well known that algebraic power series are differentially finite (D-finite): they satisfy linear differential equations with polynomial coefficients. The converse problem, whether a given D-finite power series is algebraic or…

This paper is concerned with the optimal convergence rate in homogenization of higher order parabolic systems with bounded measurable, rapidly oscillating periodic coefficients. The sharp $O(\va)$ convergence rate in the space $L^2(0,T;…

In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…

We study the homogenization of first-order Hamilton-Jacobi equations on an infinite-dimensional Hilbert space, motivated by systems of infinitely many indistinguishable particles on the torus. A central difficulty is that the analysis takes…

We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

In our paper [G{\l}uch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable for Regular Path…

In this article, we prove a decomposition theorem on differential polynomials of theta functions of high level.

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an…

We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs).

We study absolutely periodic points and trajectories of Hamiltonian systems. Our main result is a necessary and sufficient for a Hamiltonian system to have the following property: if there exists one absolutely periodic trajectory then all…

We show that there exists $0<\alpha_0<1$ (depending on the parameters) such that the fractal percolation is almost surely purely $\alpha$-unrectifiable for all $\alpha>\alpha_0$.

In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…

In this paper we provide conditions to ensure the existence, for $e>0$ sufficiently small, of periodic solutions of given period $T>0$ in a prescribed domain $U$ for a class of singularly perturbed first order differential systems. Here…

Optimal approximation and optimal interpolation problems on the classes of periodic functions that are determined by restrictions on several higher derivatives of the functions are solved.

We consider a discrete time dynamic system described by a difference equation with periodic coefficients and with additive stochastic noise. We investigate the possibility of the periodicity for the solution. In particular, we found…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

We describe a shorter algorithm for HD0L uniform recurrence problem