English

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth

Combinatorics 2024-04-30 v1 Formal Languages and Automata Theory

Abstract

The notion of inverse Lyndon word is related to the classical notion of Lyndon word. More precisely, inverse Lyndon words are all and only the nonempty prefixes of the powers of the anti-Lyndon words, where an anti-Lyndon word with respect to a lexicographical order is a classical Lyndon word with respect to the inverse lexicographic order. Each word ww admits a factorization in inverse Lyndon words, named the canonical inverse Lyndon factorization \ICFL(w)\ICFL(w), which maintains the main properties of the Lyndon factorization of ww. Although there is a huge literature on the Lyndon factorization, the relation between the Lyndon factorization \CFLin\CFL_{in} with respect to the inverse order and the canonical inverse Lyndon factorization \ICFL\ICFL has not been thoroughly investigated. In this paper, we address this question and we show how to obtain one factorization from the other via the notion of grouping. This result naturally opens new insights in the investigation of the relationship between \ICFL\ICFL and other notions, e.g., variants of Burrows Wheeler Transform, as already done for the Lyndon factorization.

Cite

@article{arxiv.2404.17969,
  title  = {From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth},
  author = {Paola Bonizzoni and Clelia De Felice and Rocco Zaccagnino and Rosalba Zizza},
  journal= {arXiv preprint arXiv:2404.17969},
  year   = {2024}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1911.01851

R2 v1 2026-06-28T16:08:36.790Z