Abstract
Let A = [aij]m×n be an m × n matrix of zeros and ones. The matrix A is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero (1,1)-entry. We characterize all linear maps perserving the set of n × 1 Ferrers vectors over the binary Boolean semiring and over the Boolean ring \({\mathbb{Z}_2}\). Also, we have achieved the number of these linear maps in each case.
References
L. B. Beasley: (0, 1)-matrices, discrepancy and preservers. Czech. Math. J. 69 (2019), 1123–1131.
W. Kuich, A. Salomaa: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science 5. Springer, Berlin, 1986.
S. M. Motlaghian, A. Armandnejad, F. J. Hall: Linear preservers of row-dense matrices. Czech. Math. J. 66 (2016), 847–858.
S. M. Motlaghian, A. Armandnejad, F. J. Hall: Strong linear preservers of dense matrices. Bull. Iran. Math. Soc. 44 (2018), 969–976.
N. Sirasuntorn, S. Sombatboriboon, N. Udomsub: Inversion of matrices over Boolean semirings. Thai J. Math. 7 (2009), 105–113.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fazlpar, L., Armandnejad, A. Linear preserver of n × 1 Ferrers vectors. Czech Math J 73, 1189–1200 (2023). https://doi.org/10.21136/CMJ.2023.0440-22
Received:
Published:
Issue Date:
DOI: https://doi.org/10.21136/CMJ.2023.0440-22