Related papers: On sets of indefinitely desubstitutable words
We show a general relation between fixed point stability of suitably perturbed transfer operators and convergence to equilibrium (a notion which is strictly related to decay of correlations). We apply this relation to deterministic…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under…
An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary…
This paper addresses the problem of stabilization for infinite-dimensional systems. In particular, we design nonlinear stabilizers for both linear and nonlinear abstract systems. We focus on two classes of systems: the first class comprises…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
We say $x \in \{0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of…
The field of constraint satisfaction problems (CSPs) studies homomorphism problems between relational structures where the target structure is fixed. Classifying the complexity of these problems has been a central quest of the field,…
The question of whether all words in two real positive definite letters have only positive eigenvalues is addressed and settled (negatively). This question was raised some time ago in connection with a long-standing problem in theoretical…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
We study infinite words coding an orbit under an exchange of three intervals which have full complexity $\C(n)=2n+1$ for all $n\in\N$ (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the…
We prove that on closed manifolds of odd Euler characteristic fixed point sets of involutions are smoothly nondisplaceable.
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
We find conditions for stationary measures of random dynamical systems on surfaces having dissipative diffeomorphisms to be absolutely continuous. These conditions involve a uniformly expanding on average property in the future (UEF) and…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
In this paper, we study infinite dimensional holomorphic vector fields on sequence spaces, having a fixed point at $0$. Under suitable hypotheses we prove the existence of analytic invariant submanifolds passing through the fixed point. The…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…