ﻻ يوجد ملخص باللغة العربية
We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and is obtained by sliding block coding. The second one is called the complete bifix decoding, and typically includes codings by non overlapping blocks of fixed length.
A factorisation $x = u_1 u_2 cdots$ of an infinite word $x$ on alphabet $X$ is called `monochromatic, for a given colouring of the finite words $X^*$ on alphabet $X$, if each $u_i$ is the same colour. Wojcik and Zamboni proved that the word $x$ is pe
In a series of papers and in his 2009 book on configurations Branko Grunbaum described a sequence of operations to produce new $(n_{4})$ configurations from various input configurations. These operations were later called the Grunbaum Incidence Calcu
In order to converge in the presence of concurrent updates, modern eventually consistent replication systems rely on causality information and operation semantics. It is relatively easy to use semantics of high-level operations on replicated data str
We analyze certain class of linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable in the ten
In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo a finite c