Latent roots and off-diagonal elements of the association matrix in PBIB designs and the number of associate classes
Page 1
H. Brzeskwiniewicz (1991)
Applicationes Mathematicae
Doerr, Benjamin (2000)
The Electronic Journal of Combinatorics [electronic only]
Leila Fazlpar, Ali Armandnejad (2023)
Czechoslovak Mathematical Journal
Let be an matrix of zeros and ones. The matrix is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero -entry. We characterize all linear maps perserving the set of Ferrers vectors over the binary Boolean semiring and over the Boolean ring . Also, we have achieved the number of these linear maps in each case.
Page 1