Related papers: On sets of indefinitely desubstitutable words
The words of a language are randomly replaced in time by new ones, but it has long been known that words corresponding to some items (meanings) are less frequently replaced than others. Usually, the rate of replacement for a given item is…
We show that the stabilization of any countable ergodic p.m.p. equivalence relation which is not Schmidt, i.e. admits no central sequences in its full group, always gives rise to a stable equivalence relation with a unique stable…
We prove that the stable endomorphism algebra of a module without self-extensions over a special biserial algebra is a gentle algebra. In particular, it is again special biserial. As a consequence, any algebra which is derived equivalent to…
We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number…
We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…
Idempotents yield much insight in the structure of finite semigroups and semirings. In this article, we obtain some results on (multiplicatively) idempotents of the endomorphism semiring of a finite chain. We prove that the set of all…
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…
We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…
Many languages' inflectional morphological systems are replete with irregulars, i.e., words that do not seem to follow standard inflectional rules. In this work, we quantitatively investigate the conditions under which irregulars can…
We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…
The robustness property of exponential dichotomies refers to the stability of this notion under small linear perturbations. In recent work~\cite{PPX}, the authors have identified a new class of perturbations under which the notion of a…
Facts happen at every interaction, but they are not absolute: they are relative to the systems involved in the interaction. Stable facts are those whose relativity can effectively be ignored. In this work, we describe how stable facts…
Let $w$ be an infinite word on an alphabet $A$. We denote by $(n_i)_{i \geq 1}$ the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of $w$. In this text, we give an explicit construction of all words $w$…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
Suppose that E is a Banach space, {\tau} a topology under which the norm of E becomes {\tau}-lower semicontinuous and S a commuting family of {\tau}-continuous nonexpansive mappings defined on a {\tau}-compact convex subset C of E: It is…