Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Additive mappings decreasing rank one
- B. Kuzma
- 15 June 2002
Abstract Let B ( X ) be the algebra of bounded operators on a real or complex Banach space X , and F( X ) a subalgebra of finite rank operators. A complete description of additive mappings Φ:F( X… Expand
Mappings that preserve pairs of operators with zero triple Jordan product
Abstract Let F be a field and n ⩾ 3 . Suppose S 1 , S 2 ⊆ M n ( F ) contain all rank-one idempotents. The structure of surjections ϕ : S 1 → S 2 satisfying ABA = 0 ⇔ ϕ ( A ) ϕ ( B ) ϕ ( A ) = 0 is… Expand
Additive mappings on symmetric matrices
Additive mappings, which do not increase the minimal rank of symmetric matrices are classified in characteristic two or three.
Additive spectrum compressors
- B. Kuzma
- 1 April 2005
Abstract Additive bijections Φ : A → B , which compress the spectrum between two unital, standard operator algebras, are characterized. Applications to local approximate (anti)multiplications are… Expand
Additive idempotence preservers
- B. Kuzma
- 1 November 2002
Abstract Let A be a local matrix algebra over a field of characteristic different from 2, B an arbitrary algebra, and X , Y Banach spaces. Additive mappings Φ: A → B , which preserve idempotents are… Expand
On diameter of the commuting graph of a full matrix algebra over a finite field
- David Dolzan, D. K. Bukovsek, B. Kuzma, Polona Oblak
- Computer Science, Mathematics
- Finite Fields Their Appl.
It is shown that the commuting graph of a matrix algebra over a finite field has diameter at most five if the size of the matrices is not a prime nor a square of a prime. Expand
Commuting graphs and extremal centralizers
- G. Dolinar, A. Guterman, B. Kuzma, Polona Oblak
- Mathematics, Computer Science
- Ars Math. Contemp.
- 26 December 2013
We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . Expand
On the gibson barrier for the pólya problem
We study lower bounds on the number of nonzero entries in (0, 1) matrices such that the permanent is always convertible to the determinant by placing ± signs on matrix entries.
On maximal distances in a commuting graph
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two… Expand