Rich words in the block reversal of a word

DOI10.1016/J.DAM.2023.03.013MaRDI QIDQ6157425zbMATH OpenFDO

Authors Kalpana Mahalingam, Anuran Maity, Palak Pandoh

Publication date 11 May 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2302.02109

zbMATH Keywords

combinatorics on wordsrich wordsrun-length encodingblock reversal

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: The block reversal of a word $w$, denoted by $mathttBR(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words whose block reversal contains only rich words. We prove that for a binary word $w$, richness of all elements of $mathttBR(w)$ depends on $l(w)$, the length of the run sequence of $w$. We show that if all elements of $mathttBR(w)$ are rich, then $2leql(w)leq8$. We also provide the structure of such words.

Recommendations

• Block reversal on finite words
• scientific article; zbMATH DE number 3896916
• A unique extension of rich words
• Rich square-free words
• Extensions of rich words
• ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
• On the number of rich words
• Inverses of words
• Towards the inverse of a word
• Palindromic factorization of rich words

Cites work

• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• A local algorithm for DNA sequence alignment with inversions
• A space-efficient algorithm for sequence alignment with inversions and reversals
• Balanced Words Having Simple Burrows-Wheeler Transform
• Balancing and clustering of words in the Burrows-Wheeler transform
• Block reversal on finite words
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• Efficient string-matching allowing for non-overlapping inversions
• Episturmian words and some constructions of de Luca and Rauzy
• LR property of non-well-formed scales
• Non-overlapping inversion on strings and languages
• On the least number of palindromes contained in an infinite word
• On the least number of palindromes in two-dimensional words
• Palindrome complexity.
• Palindromic complexity of codings of rotations
• Palindromic rich words and run-length encodings
• Palindromic richness
• Perfect balance and circularly rich words
• Sequence searching allowing for non-overlapping adjacent unbalanced translocations
• Theta palindromes in theta conjugates
• Total palindrome complexity of finite words
• Uniformly growing k-th power-free homomorphisms

Cited in

(2)

• Towards the inverse of a word
• Smallest and Largest Block Palindrome Factorizations

This page was built for publication: Rich words in the block reversal of a word

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157425)