Linear preserver of $n\times 1$ Ferrers vectors

@article{Fazlpar2023,
abstract = {Let $A=[a_\{ij\}]_\{m\times n\}$ be an $m\times 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\times 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.},
author = {Fazlpar, Leila, Armandnejad, Ali},
journal = {Czechoslovak Mathematical Journal},
keywords = {Ferrers matrix; linear preserver; Boolean semiring},
language = {eng},
number = {4},
pages = {1189-1200},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Linear preserver of $n\times 1$ Ferrers vectors},
url = {http://eudml.org/doc/299425},
volume = {73},
year = {2023},
}

TY - JOUR
AU - Fazlpar, Leila
AU - Armandnejad, Ali
TI - Linear preserver of $n\times 1$ Ferrers vectors
JO - Czechoslovak Mathematical Journal
PY - 2023
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 73
IS - 4
SP - 1189
EP - 1200
AB - Let $A=[a_{ij}]_{m\times n}$ be an $m\times 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\times 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.
LA - eng
KW - Ferrers matrix; linear preserver; Boolean semiring
UR - http://eudml.org/doc/299425
ER -