Related papers: On half-synchronized systems
We will show that a system is synchronized if and only if it has a cover whose cover map is semi-open. Also, any factor code on an irreducible sofic shift is semi-open and the image of a synchronized system by a semi-open code is…
This paper deals with synchronization of a class of infinite-dimensional systems. The considered network is described by a collection of semilinear Lipschitz boundary-actuated infinite-dimensional dynamics. For undirected connected graphs,…
We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…
Finding conditions that support synchronization is a fertile and active area of research with applications across multiple disciplines. Here we present and analyze a scheme for synchronizing chaotic dynamical systems by transiently…
In nature, instances of synchronisation abound across a diverse range of environments. In the quantum regime, however, synchronisation is typically observed by identifying an appropriate parameter regime in a specific system. In this work…
Coupled map lattices are paradigmatic models of many collective phenomena. However, quite different patterns can emerge depending on the updating scheme. While in early versions, maps were updated synchronously, there has been in recent…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
We show that the threshold of complete synchronization in a lattice of coupled non-smooth chaotic maps is determined by linear stability along the directions transversal to the synchronization subspace. We examine carefully the…
Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…
We prove a sufficient condition for synchronization for coupled one-dimensional maps and estimate the size of the window of parameters where synchronization takes place. It is shown that coupled systems on graphs with positive eigenvalues…
Generalized synchronization is plausibly the most complex form of synchronization. Previous studies have revealed the existence of weak or strong forms of generalized synchronization depending on the multi- or mono-valued nature of the…
We provide a diagrammatic criterion for semi-adequate links to be hyperbolic. We also give a conjectural description of the satellite structures of semi-adequate links. One application of our result is that the closures of sufficiently…
Transforming an asymmetric system into a symmetric system makes it possible to exploit the simplifying properties of symmetry in control problems. We define and characterize the family of symmetrizable systems, which can be transformed into…
Building on work of Ruelle and Putnam in the Smale space case, Thomsen defined the homoclinic and heteroclinic $C^\ast$-algebras for an expansive dynamical system. In this paper we define a class of expansive dynamical systems, called…
We show that the synchronized states of two systems of identical chaotic maps subject to either, a common drive that acts with a probability p in time or to the same drive acting on a fraction p of the maps, are similar. The synchronization…
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if…
We show that the threshold of complete synchronization in a lattice of coupled non-smooth chaotic maps is determined by linear stability along the directions transversal to the synchronization subspace. As a result, the numerically…
In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the…
A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…