Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
Commuting graphs and extremal centralizers
Gregor Dolinar, Aleksandr Èmilevič Guterman, Bojan Kuzma, Polona Oblak, 2014, izvirni znanstveni članek

Opis: 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.
Ključne besede: commuting graph, matrix ring, centralizer
Objavljeno v RUP: 31.12.2021; Ogledov: 725; Prenosov: 22
.pdf Celotno besedilo (228,78 KB)

3.
On maximal distances in a commuting graph
Gregor Dolinar, Bojan Kuzma, Polona Oblak, 2012, izvirni znanstveni članek

Opis: It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.
Ključne besede: matematika, linearna algebra, teorija grafov, komutirajoči grafi, matrična algebra, algebraično zaprt obseg, centralizator, razdalja v grafih, mathematics, linear algebra, graph theory, commuting graph, matrix algebra, algebraically closed field, centralizer, distance in graphs
Objavljeno v RUP: 03.04.2017; Ogledov: 2229; Prenosov: 256
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.02 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici