Related papers: On sets of indefinitely desubstitutable words
A group is said to be stable if it is isomorphic to its automorphism group. We investigate how we can extend centerless groups to construct finite stable groups with nontrivial centers. To this end, we classify all finite stable groups…
We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.
We introduce the notion of stable representations, -- it is a new class of the representations of a certain class of groups which defined with positive definite functions which generalize the classical notion of the characters (or trace).…
Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to…
We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…
An infinite word generated by a substitution is rigid if all the substitutions which fix this word are powers of a same substitution. Sturmian words as well as characteristic Arnoux-Rauzy words are known to be rigid. In the present paper,…
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called…
In the context of holomorphic families of ${\mathbb P}^k$ endomorphisms, we show that various notions of stability are equivalent. This allows us to both extend and simplify the architecture of the proof of certain results of [BBD]
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…
The thesis is devoted to relations between algebra and symbolic dynamics. Various generalisations of sturmian sequences are discoursed. Let $W$ be an infinite word over a finite alphabet $A$. The combinatorial criteria of existence of…
We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
We propose an alternative definition for families of stable pairs $(X,D)$ over a possibly non-reduced base when $D$ is reduced, by replacing $(X,D)$ with an appropriate orbifold pair $(\mathcal X,\mathcal D)$. This definition of a stable…
We study stable conditional measures for a certain equilibrium measure for hyperbolic endomorphisms, on basic sets with overlaps; we show that these conditional measures are geometric probabilities and measures of maximal stable dimension.…
We obtain some results about continuum-wise expansive homeomorphisms, such as non-existence of stable points and presence of non-trivial connected components within the local stable and unstable sets. These facts have been of importance in…
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of so-called "rich words" is that all complete returns…
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms…