Properties of Parikh Determinant Under Some Word Operations
International Journal of Foundations of Computer Science · 23.06.2026 · 1-17
DOI: 10.1142/s0129054126500231 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 23.06.2026. Verfasst von S. Thirumagal und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The notion of the Parikh matrix was introduced by Mateescu (2001) to study the numerical properties of a word over an alphabet in terms of subwords. The Parikh determinant for a word has recently been introduced to study the analogy of the classical notion of determinant in matrix theory. The Parikh determinant of a word [Formula: see text] over an alphabet [Formula: see text] can be computed by simply finding the number of occurrences of the scattered subword [Formula: see text], i.e., [Formula: see text]. This paper investigates certain Parikh determinant properties in relation to word operations such as partial sum, product, circular variance of words and SShuffle operators etc. A necessary and sufficient condition, for the Parikh determinants of two conjugate ternary words to be equal is also provided.
Zitieren
APA
Thirumagal, S., & Bera, S. (2026). Properties of Parikh Determinant Under Some Word Operations. International Journal of Foundations of Computer Science, 1-17. https://doi.org/10.1142/s0129054126500231
Vancouver
Thirumagal S, Bera S. Properties of Parikh Determinant Under Some Word Operations. International Journal of Foundations of Computer Science. 2026:1-17. doi:10.1142/s0129054126500231
BibTeX
@article{Thirumagal2026,
author = {Thirumagal, S. and Bera, Somnath},
title = {Properties of Parikh Determinant Under Some Word Operations},
journal = {International Journal of Foundations of Computer Science},
year = {2026},
pages = {1--17},
doi = {10.1142/s0129054126500231}
}
EUVIMED