• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.117-132
• /
• 2011

By developing a linear algebra program involving many different structures associated to a three-graded H*-algebra, it is shown that if L is a Lie triple automorphism of an infinite-dimensional topologically simple associative H*-algebra A, then L is either an automorphism, an anti-automorphism, the negative of an automorphism or the negative of an anti-automorphism. If A is finite-dimensional, then there exists an automorphism, an anti-automorphism, the negative of an automorphism or the negative of an anti-automorphism F : A $\rightarrow$ A such that $\delta$:= F - L is a linear map from A onto its center sending commutators to zero. We also describe L in the case of having A zero annihilator.

• Kyungpook Mathematical Journal
• /
• v.45 no.1
• /
• pp.33-43
• /
• 2005

Clones are sets of operations which are closed under composition and contain all projections. Identities of clones of term operations of a given algebra correspond to hyperidentities of this algebra, i.e., to identities which are satisfied after any replacements of fundamental operations by derived operations ([7]). If any identity of an algebra is satisfied as a hyperidentity, the algebra is called solid ([3]). Solid algebras correspond to free clones. These connections will be extended to so-called generalized clones, to strong hyperidentities and to strongly solid varieties. On the basis of a generalized superposition operation for terms we generalize the concept of a unitary Menger algebra of finite rank ([6]) to unitary Menger algebras with infinitely many nullary operations and prove that strong hyperidentities correspond to identities in free unitary Menger algebras with infinitely many nullary operations.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.2
• /
• pp.159-175
• /
• 2006

This paper is a survey on the Hyers-Ulam-Rassias stability of the Jensen functional equation in $C^*$-algebras. The concept of Hyers-Ulam-Rassias stability originated from the Th.M. Rassias' stability theorem that appeared in his paper: On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc. 72 (1978), 297-300. Its content is divided into the following sections: 1. Introduction and preliminaries. 2. Approximate isomorphisms in $C^*$-algebras. 3. Approximate isomorphisms in Lie $C^*$-algebras. 4. Approximate isomorphisms in $JC^*$-algebras. 5. Stability of derivations on a $C^*$-algebra. 6. Stability of derivations on a Lie $C^*$-algebra. 7. Stability of derivations on a $JC^*$-algebra.

• Honam Mathematical Journal
• /
• v.29 no.2
• /
• pp.213-222
• /
• 2007

A Weyl type algebra is defined in the paper (see [2],[4], [6], [7]). A Weyl type non-associative algebra $\bar{WN_{m,n,s}}$ and its restricted subalgebra $\bar{WN_{m,n,s_r}}$ are defined in the papers (see [1], [14], [16]). Several authors find all the derivations of an associative (Lie or non-associative) algebra (see [3], [1], [5], [7], [10], [16]). We find Der($\bar_{WN_{0,0,1_n}}$) of the algebra $\bar_{WN_{0,0,1_n}}$ and show that the algebras $\bar_{WN_{0,0,1_n}}$ and $\bar_{WN_{0,0,s_1}}$ are not isomorphic in this work. We show that the associator of $\bar_{WN_{0,0,1_n}}$ is zero.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.1
• /
• pp.1-15
• /
• 2000

In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.17-21
• /
• 2011

Let A be a co-Poisson Hopf algebra with Poisson co-bracket $\delta$. Here it is shown that the Hopf dual $A^{\circ}$ is a Poisson Hopf algebra with Poisson bracket {f, g}(x) = < $\delta(x)$, $f\;{\otimes}\;g$ > for any f, g $\in$ $A^{\circ}$ and x $\in$ A if A is an almost normalizing extension over the ground field. Moreover we get, as a corollary, the fact that the Hopf dual of the universal enveloping algebra U(g) for a finite dimensional Lie bialgebra g is a Poisson Hopf algebra.

• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.485-494
• /
• 1998

This study is on the theory of Piaget's reflective abstraction and the mechanism of the development of knowledge and the history of algebra and its application to understand the difficulties that many students have in learning algebra. Piaget considers the development of knowledge as a linear process. The stages in the construction of different forms of knowledge are sequential and each stage begins with reorganization. The reorganization consists of the projection onto a higher level from the lower level and the reflection which reconstructs and reorganizes within a lager system that is transferred by profection. Piaget shows that the mechanisms mediating transitions from one historical period to the next are analogous to those mediating the transition from one psychogenetic stage to the next and characterizes the mechanism as the intra, inter, trans sequence. The historical development of algebra is characterized by three periods, which are intra inter, transoperational. The analysis of the history of algebra by the mechanism explains why the difficulties that students have in learning algebra occur and shows that the roles of teachers are important to help students to overcome the difficulties.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.1
• /
• pp.91-103
• /
• 2013

Let (D,B) be an admissible pair. Then recall that $B\;{\times}^L_HD^{{\rightarrow}{\pi}_D}_{{\leftarrow}i_D}\;D$ are bialgebra maps satisfying ${\pi}_D{\circ}i_D=I$. We have solved a converse in case D is a Hopf algebra. Let D be a Hopf algebra with antipode $S_D$ and be a left H-comodule algebra and a left H-module coalgebra over a field $k$. Let A be a bialgebra over $k$. Suppose $A^{{\rightarrow}{\pi}}_{{\leftarrow}i}D$ are bialgebra maps satisfying ${\pi}{\circ}i=I_D$. Set ${\Pi}=I_D*(i{\circ}s_D{\circ}{\pi}),B=\Pi(A)$ and $j:B{\rightarrow}A$ be the inclusion. Suppose that ${\Pi}$ is an algebra map. We show that (D,B) is an admissible pair and $B^{\leftarrow{\Pi}}_{\rightarrow{j}}A^{\rightarrow{\pi}}_{\leftarrow{i}}D$ is an admissible mapping system and that the generalized biproduct bialgebra $B{\times}^L_HD$ is isomorphic to A as bialgebras.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2004

This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.

• Journal for History of Mathematics
• /
• v.15 no.2
• /
• pp.49-68
• /
• 2002

One of the characteristics of modem mathematics is to use algebra in every fields of mathematics. But we don't have the exact definition of algebra, and we can't clearly define algebraic thinking. In order to solve this problem, this paper investigate the history of algebra. First, we describe some of the features of proportional Babylonian thinking by analysing some problems. In chapter 4, we consider Greek's analytical method and proportional theory. And in chapter 5, we deal with Diophantus' algebraic method by giving an overview of Arithmetica. Finally we investigate Viete's thinking of algebra through his ‘the analytical art’. By investigating these history of algebra, we reach the following conclusions. 1. The origin of algebra comes from problem solving(various equations). 2. The origin of algebraic thinking is the proportional thinking and the analytical thinking. 3. The thing that plays an important role in transition from arithmetical thinking to algebraic thinking is Babylonian ‘the false value’ idea and Diophantus’ ‘arithmos’ concept.