相关论文: On the minimal components of substitution subshift…

Component substitution has numerous practical applications and constitutes an active research topic. This paper proposes to enrich an existing component-based framework--a model with dynamic reconfigurations making the system evolve--with a…

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…

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…

It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually $\mathbb{Z}$ [DDPM15, CK15]. In this article we extend this result to a broader class proving that 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…

An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…

We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems described by $S$-adic structures satisfying natural mild conditions, such as recognizability and primitiveness. Under the additional assumptions…

We investigate the dynamics of substitution subshifts and their associated tiling spaces. For a given subshift, the associated tiling spaces are all homeomorphic, but their dynamical properties may differ. We give criteria for such a tiling…

We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…

In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…

We study topological factors of rank-one subshifts and prove that those factors that are themselves subshifts are either finite or isomorphic to the original rank-one subshifts. Thus, we completely characterize the subshift factors of…

This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…

We study stationary ordered Bratteli diagrams and give necessary and sufficient conditions for these orders to generate a continuous Vershik map. We apply this to finding adic representations for one sided substitution subshifts. We give an…

We consider minimal, aperiodic symbolic subshifts and show how to characterize the combinatorial property of bounded powers by means of a metric property. For this purpose we construct a family of graphs which all approximate the subshift…

We analyze the performance of alternating minimization for loss functions optimized over two variables, where each variable may be restricted to lie in some potentially nonconvex constraint set. This type of setting arises naturally in…

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…

In the study of substitution minimal subshifts, some complicated trivialities have hindered simple and general approaches. Recently, Maloney and Rust introduced the term "tame," simplifying the study. We introduce another term…

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…