Related papers: Decidability of the isomorphism problem between mu…

Mechanisms are elucidated underlying the existence of dynamical systems whose generic solutions approach asymptotically (at large time) isochronous evolutions: all their dependent variables tend asymptotically to functions periodic with the…

This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…

We explore the relationship between subgroups and the possible shifts of finite type (SFTs) that can be defined on the group. In particular, we investigate two group invariants, weak periodicity and strong periodicity, defined via symbolic…

Given a dynamical system, we study the so-called space of shift functions thus introducing another vision on bifurcations and chaos. As an application of the obtained results, we give a partial solution to an open problem formulated in…

Given two two-dimensional conformal field theories, a domain wall -- or defect line -- between them is called invertible if there is another defect with which it fuses to the identity defect. A defect is called topological if it is…

We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

The problem of deciding, given a complex variety X, a point x in X, and a subvariety Z of X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert's…

We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…

Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

In this article it is proved that the dynamical properties of a broad class of semilinear parabolic problems are sensitive to arbitrarily small but smooth perturbations of the nonlinear term, when the spatial dimension is either equal to…

The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…

We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…

In their paper on multivariable dynamics, Davidson and Katsoulis conjectured that two multivariable dynamical systems have isomorphic tensor algebras if and only if they are piecewise conjugate. We disprove the conjecture by constructing…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…

Bifurcation with symmetry is considered in the case of an isotropy subgroup with a two-dimensional fixed point subspace and non-zero quadratic terms. In general, there are one or three branches of solutions, and five qualitatively different…