1. |
2. Commuting graphs and extremal centralizersGregor Dolinar, Aleksandr Èmilevič Guterman, Bojan Kuzma, Polona Oblak, 2014, original scientific article Abstract: We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra ▫$M_n(\mathbb{F})$▫ over an arbitrary field ▫$\mathbb{F}$▫. It is known that if ▫$\mathbb{F}$▫ is an algebraically closed field and ▫$n \ge 3$▫, then the diameter of the commuting graph of ▫$M_n(\mathbb{F})$▫ is always equal to four. We construct a concrete example showing that if ▫$\mathbb{F}$▫ is not algebraically closed, then the commuting graph of ▫$M_n(\mathbb{F})$▫ can be connected with the diameter at least five.
Keywords: commuting graph, matrix ring, centralizer
Published in RUP: 31.12.2021; Views: 790; Downloads: 23
 Full text (228,78 KB) |
3. Bar´ery Gibsona dlja problemy PoliaGregor Dolinar, Aleksandr Èmilevič Guterman, Bojan Kuzma, 2010, published scientific conference contribution Abstract: V članku je obravnavana spodnja meja za število neničelnih elementov v ▫$(0, 1)$▫ matrikah, pri katerem se da permanento vedno pretvoriti v determinanto samo s spreminjanjem predznaka ▫$pm$▫ elementom matrike.
Keywords: matematika, linearna algebra, teorija matrik, permanenta, determinanta
Published in RUP: 03.04.2017; Views: 2068; Downloads: 64
 Link to full text |
4. Permanent versus determinant over a finite fieldGregor Dolinar, Aleksandr Èmilevič Guterman, Bojan Kuzma, Marko Orel, 2013, published scientific conference contribution Abstract: Let ▫$\mathbb{F}$▫ be a finite field of characteristic different from 2. We study the cardinality of sets of matrices with a given determinant or a given permanent for the set of Hermitian matrices ▫$\mathcal{H}_n(\mathbb{F})$▫ and for the whole matrix space ▫$M_n(\mathbb{F})$▫. It is known that for ▫$n = 2$▫, there are bijective linear maps ▫$\Phi$▫ on ▫$\mathcal{H}_n(\mathbb{F})$▫ and ▫$M_n(\mathbb{F})$▫ satisfying the condition per ▫$A = \det \Phi(A)$▫. As an application of the obtained results, we show that if ▫$n \ge 3$▫, then the situation is completely different and already for ▫$n = 3$▫, there is no pair ofmaps ▫$(\Phi, \phi)$▫, where ▫$\Phi$▫ is an arbitrary bijective map on matrices and ▫$\phi \colon \mathbb{F} \to \mathbb{F}$▫ is an arbitrary map such that per ▫$A = \phi(\det \Phi(A))$▫ for all matrices ▫$A$▫ from the spaces ▫$\mathcal{H}_n(\mathbb{F})$▫ and ▫$M_n(\mathbb{F})$▫, respectively. Moreover, for the space ▫$M_n(\mathbb{F})$▫, we show that such a pair of transformations does not exist also for an arbitrary ▫$n > 3$▫ if the field ▫$\mathbb{F}$▫ contains sufficiently many elements (depending on ▫$n$▫). Our results are illustrated by a number of examples.
Keywords: mathematics, linear algebra, matrix theory, permanent, determinant
Published in RUP: 03.04.2017; Views: 2096; Downloads: 125
Link to full text |
5. Rank-permutable additive mappingsAnna A. Alieva, Aleksandr Èmilevič Guterman, Bojan Kuzma, 2006, original scientific article Abstract: Let ▫$\sigma$▫ be a fixed non-identical permutation on ▫$k$▫ elements. Additive bijections ▫$T$▫ on the matrix algebra ▫$M_n(\mathbb{F})$▫ over a field ▫$\mathbb{F}$▫ of characteristic zero, with the property that ▫$\rm{rk} (A_1...A_k) = \rm{rk} (A_{\sigma(1)}...A_{\sigma(k)})$▫ implies the same condition on the ▫$T$▫ images, are characterized. It is also shown that the surjectivity assumption can be relaxed, if this property is preserved in both directions.
Keywords: mathematics, linearna algebra, matrix algebra, rank, permutation, additive preservers
Published in RUP: 15.10.2013; Views: 3411; Downloads: 89
Link to full text |
