• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1185-1189
• /
• 2008

In this paper we show that the polynomial of degree 9 called generalized algebraicity is a polynomial identity for $3{\times}3$ matrices. ([5])

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.373-385
• /
• 2009

An m${\times}$n Boolean matrix A is called regular if there exists an n${\times}$m Boolean matrix X such that AXA = A. We have characterizations of Boolean regular matrices. We also determine the linear operators that strongly preserve Boolean regular matrices.

• Kyungpook Mathematical Journal
• /
• v.64 no.2
• /
• pp.205-218
• /
• 2024

Let 𝒜 be a Banach algebra. An element a ∈ 𝒜 has generalized Drazin inverse if there exists b ∈ 𝒜 such that b = bab, ab = ba, a - a²b ∈ 𝒜^qnil. New additive results for the generalized Drazin inverse of an operator over a Banach space are presented. we extend the main results of a paper of Shakoor, Yang and Ali from 2013 and of Wang, Huang and Chen from 2017. Appling these results to 2×2 operator matrices we also generalize results of a paper of Deng, Cvetković-Ilić and Wei from 2010.

• Communications of Mathematical Education
• /
• v.21 no.4
• /
• pp.597-612
• /
• 2007

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.

• Communications of the Korean Mathematical Society
• /
• v.18 no.3
• /
• pp.439-447
• /
• 2003

Let (equation omitted) be a symmetrizable Kac-Moody algebra with the indecomposable generalized Cartan matrix A and W be its Weyl group. Let $\theta$ be the highest root of the corresponding finite dimensional simple Lie algebra ${\gg}$ of g. For the type ${A_N}^{(r)}$, we give an element $\omega_{o}\;\in\;W$ such that ${{\omega}_o}^{-1}({\{\Delta\Delta}_{+}})\;=\;{\{\Delta\Delta}_{-}}$. And then we prove that the degree of nilpotency of the subalgebra (equation omitted) is greater than or equal to $ht{\theta}+1$.

• Journal of the Chungcheong Mathematical Society
• /
• v.13 no.1
• /
• pp.139-144
• /
• 2000

The generalized noncommutative torus $T_{\rho}^d$ of rank m was defined in [2]. Assume that for the completely irrational noncommutative subtorus $A_{\rho}$ of rank m of $T_{\rho}^d$ there is no integer q > 1 such that $tr(K_0(A_{\rho}))=\frac{1}{q}{\cdot}tr(K_0(A_{\rho^{\prime}}))$ for $A_{\rho^{\prime}}$ a completely irrational noncommutative torus of rank m. All $C^*$-algebras ${\Gamma}({\eta})$ of sections of locally trivial $C^*$-algebra bundles ${\eta}$ over $M=\prod_{i=1}^{e}S^{2k_i}{\times}\prod_{i=1}^{s}S^{2n_i+1}$, $\prod_{i=1}^{s}\mathbb{PR}_{2n_i}$, or $\prod_{i=1}^{s}L_{k_i}(n_i)$ with fibres $T_{\rho}^d{\otimes}M_c(\mathbb{C})$ were constructed in [6, 7, 8]. We prove that ${\Gamma}({\eta}){\otimes}M_{p^{\infty}}$ is isomorphic to $C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C}){\otimes}M_{p^{\infty}}$ if and only if the set of prime factors of cd is a subset of the set of prime factors of p, that $\mathcal{O}_{2u}{\otimes}{\Gamma}({\eta})$ is isomorphic to $\mathcal{O}_{2u}{\otimes}C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C})$ if and only if cd and 2u - 1 are relatively prime, and that $\mathcal{O}_{\infty}{\otimes}{\Gamma}({\eta})$ is not isomorphic to $\mathcal{O}_{\infty}{\otimes}C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C})$ if cd > 1 when no non-trivial matrix algebra can be ${\Gamma}({\eta})$.

• The Pure and Applied Mathematics
• /
• v.17 no.1
• /
• pp.107-113
• /
• 2010

In this paper, we study the root system of rank 2 symmetric hyperbolic Kac-Moody algebras. We give the sufficient conditions for existence of imaginary roots of square length -2k ($k\;{\in}\;\mathbb{Z}$>0). We also give several relations between the roots on g(A).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.8 s.338
• /
• pp.1-10
• /
• 2005

In this paper, the explicit low density codes construction from the generalized permutation matrices related to algebra theory is investigated, and we design several Jacket inverse block matrices on the recursive formula and permutation matrices. The results show that the proposed scheme is a simple and fast way to obtain the low density codes, and we also Proved that the structured low density parity check (LDPC) codes, such as the $\pi-rotation$ LDPC codes are the low density Jacket inverse block matrices too.

• Communications of Mathematical Education
• /
• v.37 no.1
• /
• pp.65-84
• /
• 2023

The method of Lagrange multipliers, one of the most fundamental algorithms for solving equality constrained optimization problems, has been widely used in basic mathematics for artificial intelligence (AI), linear algebra, optimization theory, and control theory. This method is an important tool that connects calculus and linear algebra. It is actively used in artificial intelligence algorithms including principal component analysis (PCA). Therefore, it is desired that instructors motivate students who first encounter this method in college calculus. In this paper, we provide an integrated perspective for instructors to teach the method of Lagrange multipliers effectively. First, we provide visualization materials and Python-based code, helping to understand the principle of this method. Second, we give a full explanation on the relation between Lagrange multiplier and eigenvalues of a matrix. Third, we give the proof of the first-order optimality condition, which is a fundamental of the method of Lagrange multipliers, and briefly introduce the generalized version of it in optimization. Finally, we give an example of PCA analysis on a real data. These materials can be utilized in class for teaching of the method of Lagrange multipliers.