On M-unambiguity of Parikh matrices

• Main Author: Wen Chean Teh
• Format: Article
• Language: English
• Published: InaCombS; Universitas Jember; dan Universitas Indonesia 2020-06-01
• Series: Indonesian Journal of Combinatorics
• Subjects: parikh mapping; subword occurrence; injectivity problem; print; strongly m-equivalent
• Online Access: http://www.ijc.or.id/index.php/ijc/article/view/131

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>The Parikh matrix mapping was introduced by Mateescu <em>et al</em>. in 2001 as a canonical generalization of the classical Parikh mapping. The injectivity problem of Parikh matrices, even for ternary case, has withstanded numerous attempts over a decade by various researchers, among whom is Serbanuta. Certain </span><em>M</em><span>-ambiguous words are crucial in Serbanuta's findings about the number of </span><em>M</em><span>-unambiguous prints. We will show that these words are in fact strongly </span><em>M</em><span>-ambiguous, thus suggesting a possible extension of Serbanuta’s work to the context of strong </span><span>M</span><span>-equivalence. In addition, initial results pertaining to a related conjecture by Serbanuta will be presented.</span></p></div></div></div>