• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.669-677
• /
• 1996

Let $M_n$ be the $C^*$-algebra of all $n \times n$ matrices over the complex field, and $P[M_m, M_n]$ the convex cone of all positive linear maps from $M_m$ into $M_n$ that is, the maps which send the set of positive semidefinite matrices in $M_m$ into the set of positive semi-definite matrices in $M_n$. The convex structures of $P[M_m, M_n]$ are highly complicated even in low dimensions, and several authors [CL, KK, LW, O, R, S, W]have considered the possibility of decomposition of $P[M_m, M_n] into subcones.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.161-174
• /
• 2000

This paper provides an implementation of data envelopment analysis (DEA) developed by Charnes et al. using SAS. Since a flexible interactive matrix language SAS/IML included in the SAS has a syntax similar with the matrix algebra, one can easily create and understand SAS/IML code for DEA. In this paper, a simple SAS/IML code for DEA and its illustrative implementation with an input-output data set of 25 American private university research libraries are provided.

• Journal of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.689-695
• /
• 1995

Let G be a finite group with k distinct conjugacy classes $C_1, C_2, \cdots, C_k$ and F an algebraically closed field such that char$(F){\dag}\left$\mid$ G \right$\mid$$. We denoted by $Irr_F$(G) the set of all irreducible F-characters of G and $Cf_F$(G) the set of all class functions of G into F. Then $Cf_F$(G) is a commutative F-algebra with an F-basis $Irr_F(G) = {\chi_1, \chi_2, \cdots, \chi_k}$.

• Bulletin of the Korean Chemical Society
• /
• v.28 no.3
• /
• pp.408-412
• /
• 2007

Combining the analytical transfer matrix method with supersymmetry algebra, a new quantization condition is suggested. To demonstrate the efficiency of the new quantization condition, the eigenenergies of the Coulomb potential are analytically derived. The scattering-led phase shifts are also determined and they are the same for all Coulomb potential states. It is found that the new quantization condition is mathematically simple and exact.

• Journal of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.539-552
• /
• 2006

For an $n{\times}n$ Boolean matrix A, A is called nilpotent if $A^m=O$ for some positive integer m. We consider the set of $n{\times}n$ nilpotent Boolean matrices and we characterize linear operators that strongly preserve nilpotent matrices over Boolean algebras.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.637-657
• /
• 2021

In this paper, we decompose (under unitary similarity) the Kronecker sum A ⊞ A (= A ⊗ I + I ⊗ A) into a direct sum of irreducible matrices, when A is a 3×3 matrix. As a consequence we identify 𝒦(A⊞A) as the direct sum of several full matrix algebras as predicted by Artin-Wedderburn theorem, where 𝒦(T) is the unital algebra generated by Tand T^*.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.133-139
• /
• 2022

We offered a new method for constructing Latin squares. We introduce the concept of a standard form via example for Latin squares of order n and we also call it symmetric BCL algebras matrix, and thereby become BCL algebra representations of the picture of Latin squares. Our research shows that some new properties of the Latin squares with BCL algebras are in ℤ_n.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.451-457
• /
• 2002

Let (R, m, k) be a maximal commutative k-subalgebra of M$\sub$n/(k) where the index of nilpotency i(m) of m is 3. If the socle of R is of special case, then we can construct some isomorphic maximal commutative subalgebras.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.37-48
• /
• 2009

In the theory and the applications of Numerical Linear Algebra, the class of H-matrices is very important. In recent years, many appeared works have proposed iterative criterion for H-matrices. In this paper, we provide a new type of interleaved iterative algorithm, which is always convergent in finite steps for H-matrices and needs fewer iterations than those proposed in the related works, and a corresponding algorithm for general matrix, which eliminates the redundant computations when the given matrix is not an H-matrix. Finally, several numerical examples are presented to show the effectiveness of the proposed algorithms.

• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.507-521
• /
• 2019

For any $m{\times}n$ nonbinary Boolean matrix A, its spanning column rank is the minimum number of the columns of A that spans its column space. We have a characterization of spanning column rank-1 nonbinary Boolean matrices. We investigate the linear operators that preserve the spanning column ranks of matrices over the nonbinary Boolean algebra. That is, for a linear operator T on $m{\times}n$ nonbinary Boolean matrices, it preserves all spanning column ranks if and only if there exist an invertible nonbinary Boolean matrix P of order m and a permutation matrix Q of order n such that T(A) = PAQ for all $m{\times}n$ nonbinary Boolean matrix A. We also obtain other characterizations of the (spanning) column rank preserver.