相关论文: Decidability of the isomorphism problem between mu…
We study various aspects of periodic points for random substitution subshifts. In order to do so, we introduce a new property for random substitutions called the disjoint images condition. We provide a procedure for determining the property…
We consider the set of bimodal linear systems consisting of two linear dynamics acting on each side of a given hyperplane, assuming continuity along the separating hyperplane. Focusing on the unobservable planar ones, we obtain a simple…
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…
The irreducible representations of all of the 80 diperiodic groups, being the symmetries of the systems translationally periodical in two directions, are calculated. To this end, each of these groups is factorized as the product of a…
This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…
Exploiting the indistinguishability of objects in a probabilistic graphical model such as a factor graph is key to lifted probabilistic inference algorithms and allows for tractable probabilistic inference problems with respect to domain…
We prove that if two finite metacyclic groups have isomorphic rational group algebras, then they are isomorphic. This contributes to understand where is the line separating positive and negative solutions to the Isomorphism Problem for…
In this paper we study substitutions on $A^\mathbb{Z}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The…
The article presents a new perspective on the isomorphism problem for non-ergodic measure-preserving dynamical systems with discrete spectrum which is based on the connection between ergodic theory and topological dynamics constituted by…
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…
We study the effect of external forcing on the saddle-node bifurcation pattern of interval maps. By replacing fixed points of unperturbed maps by invariant graphs, we obtain direct analogues to the classical result both for random forcing…
We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…
We consider the structure of aperiodic points in $\mathbb Z^2$-subshifts, and in particular the positions at which they fail to be periodic. We prove that if a $\mathbb Z^2$-subshift contains points whose smallest period is arbitrarily…
Autonomous morphology, such as inflection class systems and paradigmatic distribution patterns, is widespread and diachronically resilient in natural language. Why this should be so has remained unclear given that autonomous morphology…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…
Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…
We study the problems arising from modeling high-dimensional tensor-valued time series under a Tucker decomposition-based factor model with multiple structural change points. First, we propose an algorithm for detecting the multiple change…