298 research outputs found

    Generalized Thue-Morse words and palindromic richness

    Get PDF
    We prove that the generalized Thue-Morse word tb,m\mathbf{t}_{b,m} defined for b≥2b \geq 2 and m≥1m \geq 1 as tb,m=(sb(n)mod  m)n=0+∞\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}, where sb(n)s_b(n) denotes the sum of digits in the base-bb representation of the integer nn, has its language closed under all elements of a group DmD_m isomorphic to the dihedral group of order 2m2m consisting of morphisms and antimorphisms. Considering simultaneously antimorphisms Θ∈Dm\Theta \in D_m, we show that tb,m\mathbf{t}_{b,m} is saturated by Θ\Theta-palindromes up to the highest possible level. Using the terminology generalizing the notion of palindromic richness for more antimorphisms recently introduced by the author and E. Pelantov\'a, we show that tb,m\mathbf{t}_{b,m} is DmD_m-rich. We also calculate the factor complexity of tb,m\mathbf{t}_{b,m}.Comment: 11 page

    Group-Like algebras and Hadamard matrices

    Get PDF
    We give a description in terms of square matrices of the family of group-like algebras with S∗id=id∗S=uϵS*id=id*S=u\epsilon. In the case that S=idS=id and charkchar\Bbbk is not 2 and does not divide the dimension of the algebra, this translation take us to Hadamard matrices and, particularly, to examples of biFrobenius algebras satisfying S∗id=id∗S=uϵS*id=id*S=u\epsilon and that are not Hopf algebras. Finally, we generalize some known results on separability and coseparability valid for finite dimensional Hopf algebras to this special class of biFrobenius algebras with S∗id=id∗S=uϵS*id=id*S=u\epsilon, presenting a version of Maschke's theorem for this family

    Languages invariant under more symmetries: overlapping factors versus palindromic richness

    Full text link
    Factor complexity C\mathcal{C} and palindromic complexity P\mathcal{P} of infinite words with language closed under reversal are known to be related by the inequality P(n)+P(n+1)≤2+C(n+1)−C(n)\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 + \mathcal{C}(n+1)-\mathcal{C}(n) for any n∈Nn\in \mathbb{N}\,. Word for which the equality is attained for any nn is usually called rich in palindromes. In this article we study words whose languages are invariant under a finite group GG of symmetries. For such words we prove a stronger version of the above inequality. We introduce notion of GG-palindromic richness and give several examples of GG-rich words, including the Thue-Morse sequence as well.Comment: 22 pages, 1 figur
    • …
    corecore