Algebraic properties of Parikh matrices of binary picture arrays

DOI10.1155/2020/3236405MaRDI QIDQ2194661zbMATH OpenOpenAlexFDO

Authors Somnath Bera, S. Sriram, Atulya K. Nagar, K. G. Subramanian, Linqiang Pan

Publication date 7 September 2020

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/3236405

Mathematics Subject Classification ID

Basic linear algebra (15A99) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Review text

Summary: A word is a finite sequence of symbols. Parikh matrix of a word is an upper triangular matrix with ones in the main diagonal and nonnegative integers above the main diagonal which are counts of certain scattered subwords in the word. On the other hand, a picture array, which is a rectangular arrangement of symbols, is an extension of the notion of a word to two dimensions. Parikh matrices associated with a picture array have been introduced, and their properties have been studied. Here, we obtain certain algebraic properties of Parikh matrices of binary picture arrays based on the notions of power, fairness, and a restricted shuffle operator extending the corresponding notions studied in the case of words. We also obtain properties of Parikh matrices of arrays formed by certain geometric operations.

Recommendations

• Two-dimensional digitized picture arrays and Parikh matrices
• Theory Is Forever
• ON PARIKH MATRICES
• Some algebraic aspects of Parikh q-matrices
• On a conjecture about Parikh matrices
• Some characterizations of Parikh matrix equivalent binary words
• Generalized Pascal matrices and their algebraic properties
• Algebraic structure and properties of generalized Pascal matrices
• Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
• Parikh images of matrix ins-del systems

Cites work

• A new operator over Parikh languages
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• Comparing subword occurrences in binary D0L sequences
• Core words and Parikh matrices
• Fibonacci arrays and their two-dimensional repetitions
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1408354 (Why is no real title available?)
• On core words and the Parikh matrix mapping
• On fair words
• ON PARIKH MATRICES
• Parikh matrices for powers of words
• Periodic-like words, periodicity, and boxes
• Periodicity in rectangular arrays
• REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS
• Some characterizations of Parikh matrix equivalent binary words
• The origins of combinatorics on words
• Theory Is Forever
• Two-dimensional digitized picture arrays and Parikh matrices
• Two-dimensional maximal repetitions
• Two-Dimensional Periodicity in Rectangular Arrays

Cited in

(9)

• Erasure and error correcting ability of Parikh matrices
• Two-dimensional digitized picture arrays and Parikh matrices
• Binary images, M-vectors, and ambiguity
• Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator
• Picture-valued parity-biquandle bracket
• Prouhet array morphism and Parikh \(\mathtt{q}\)-matrix
• Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
• Binomial coefficients of multidimensional arrays
• Extensions of Parikh matrix of a word to a two-dimensional binary word

This page was built for publication: Algebraic properties of Parikh matrices of binary picture arrays

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