Possible isolation number of a matrix over nonnegative integers

LeRoy B. Beasley; Young Bae Jun; Seok-Zun Song

Czechoslovak Mathematical Journal (2018)

  • Volume: 68, Issue: 4, page 1055-1066
  • ISSN: 0011-4642

Abstract

top
Let + be the semiring of all nonnegative integers and A an m × n matrix over + . The rank of A is the smallest k such that A can be factored as an m × k matrix times a k × n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A . For A with isolation number k , we investigate the possible values of the rank of A and the Boolean rank of the support of A . So we obtain that the isolation number and the Boolean rank of the support of a given matrix are the same if and only if the isolation number is 1 or 2 only. We also determine a special type of m × n matrices whose isolation number is m . That is, those matrices are permutationally equivalent to a matrix A whose support contains a submatrix of a sum of the identity matrix and a tournament matrix.

How to cite

top

Beasley, LeRoy B., Jun, Young Bae, and Song, Seok-Zun. "Possible isolation number of a matrix over nonnegative integers." Czechoslovak Mathematical Journal 68.4 (2018): 1055-1066. <http://eudml.org/doc/294383>.

@article{Beasley2018,
abstract = {Let $\mathbb \{Z\}_+$ be the semiring of all nonnegative integers and $A$ an $m\times n$ matrix over $\mathbb \{Z\}_+$. The rank of $A$ is the smallest $k$ such that $A$ can be factored as an $m\times k$ matrix times a $k\times n$ matrix. The isolation number of $A$ is the maximum number of nonzero entries in $A$ such that no two are in any row or any column, and no two are in a $2\times 2$ submatrix of all nonzero entries. We have that the isolation number of $A$ is a lower bound of the rank of $A$. For $A$ with isolation number $k$, we investigate the possible values of the rank of $A$ and the Boolean rank of the support of $A$. So we obtain that the isolation number and the Boolean rank of the support of a given matrix are the same if and only if the isolation number is $1$ or $2$ only. We also determine a special type of $m \times n$ matrices whose isolation number is $m$. That is, those matrices are permutationally equivalent to a matrix $A$ whose support contains a submatrix of a sum of the identity matrix and a tournament matrix.},
author = {Beasley, LeRoy B., Jun, Young Bae, Song, Seok-Zun},
journal = {Czechoslovak Mathematical Journal},
keywords = {rank; Boolean rank; isolated entry; isolation number},
language = {eng},
number = {4},
pages = {1055-1066},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Possible isolation number of a matrix over nonnegative integers},
url = {http://eudml.org/doc/294383},
volume = {68},
year = {2018},
}

TY - JOUR
AU - Beasley, LeRoy B.
AU - Jun, Young Bae
AU - Song, Seok-Zun
TI - Possible isolation number of a matrix over nonnegative integers
JO - Czechoslovak Mathematical Journal
PY - 2018
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 68
IS - 4
SP - 1055
EP - 1066
AB - Let $\mathbb {Z}_+$ be the semiring of all nonnegative integers and $A$ an $m\times n$ matrix over $\mathbb {Z}_+$. The rank of $A$ is the smallest $k$ such that $A$ can be factored as an $m\times k$ matrix times a $k\times n$ matrix. The isolation number of $A$ is the maximum number of nonzero entries in $A$ such that no two are in any row or any column, and no two are in a $2\times 2$ submatrix of all nonzero entries. We have that the isolation number of $A$ is a lower bound of the rank of $A$. For $A$ with isolation number $k$, we investigate the possible values of the rank of $A$ and the Boolean rank of the support of $A$. So we obtain that the isolation number and the Boolean rank of the support of a given matrix are the same if and only if the isolation number is $1$ or $2$ only. We also determine a special type of $m \times n$ matrices whose isolation number is $m$. That is, those matrices are permutationally equivalent to a matrix $A$ whose support contains a submatrix of a sum of the identity matrix and a tournament matrix.
LA - eng
KW - rank; Boolean rank; isolated entry; isolation number
UR - http://eudml.org/doc/294383
ER -

References

top
  1. Beasley, L. B., 10.1016/j.laa.2011.12.013, Linear Algebra Appl. 436 (2012), 3469-3474. (2012) Zbl1245.15003MR2900729DOI10.1016/j.laa.2011.12.013
  2. Beasley, L. B., Gregory, D. A., Pullman, N. J., 10.1016/0024-3795(85)90098-9, Linear Algebra Appl. 65 (1985), 207-223. (1985) Zbl0561.15002MR0774353DOI10.1016/0024-3795(85)90098-9
  3. Bondy, J. A., Murty, U. S. R., Graph Theory, Graduate texts in Mathematics 244, Springer, Berlin (2008). (2008) Zbl1134.05001MR2368647
  4. Brualdi, R. A., Ryser, H. J., 10.1017/CBO9781107325708, Encyclopedia of Mathematics and Its Applications 39, Cambridge University Press, Cambridge (1991). (1991) Zbl0746.05002MR1130611DOI10.1017/CBO9781107325708
  5. Caen, D. de, Gregory, D. A., Pullman, N. J., The Boolean rank of zero-one matrices, Combinatorics and Computing Proc. 3rd Caribb. Conf., Cave Hill/Barbados (1981), 169-173. (1981) Zbl0496.20052MR0657202
  6. Gregory, D. A., Pullman, N. J., Jones, K. F., Lundgren, J. R., 10.1016/0095-8956(91)90006-6, J. Comb. Theory, Ser. B 51 (1991), 73-89. (1991) Zbl0733.05064MR1088627DOI10.1016/0095-8956(91)90006-6
  7. Kato, A., 10.1007/BF03167200, Japan J. Ind. Appl. Math. 10 (1993), 1-19. (1993) Zbl0782.68060MR1208179DOI10.1007/BF03167200
  8. Markowsky, G., 10.1007/BF00383950, Order 9 (1992), 265-290. (1992) Zbl0778.06007MR1211380DOI10.1007/BF00383950

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.