• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.493-503
• /
• 2014

We consider the simple antisymmetrized algebra $N(e^{A_P},n,t)_1^-$. The simple non-associative algebra and its simple subalgebras are defined in the papers [1], [3], [4], [5], [6], [8], [13]. Some authors found all the derivations of an associative algebra, a Lie algebra, and a non-associative algebra in their papers [2], [3], [5], [7], [9], [10], [13], [15], [16]. We find all the derivations of the Lie subalgebra $N(e^{{\pm}x_1x_2x_3},0,3)_{[1]}{^-}$ of $N(e^{A_p},n,t)_k{^-}$ in this paper.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.2
• /
• pp.77-86
• /
• 2023

The purpose of this paper is to show that a certain finite dimensional representation of the rational Cherednik algebra of type A has a basis consisting of simultaneous eigenvectors for the actions of a certain family of commuting elements, which are introduced in the author's previous paper. To this end, we introduce a combinatorial object, which is called a restricted arrangement of colored beads, and consider an action of the affine symmetric group on the set of the arrangements.

• Journal of the Korean Mathematical Society
• /
• v.44 no.5
• /
• pp.1185-1195
• /
• 2007

We will discuss some very old and some new open problems concerning infinite dimensional algebras. All these problems have been inspired by combinatorial group theory.

• Journal of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.427-442
• /
• 2014

A previous work gave a combinatorial description of the crystal B(${\infty}$), in terms of certain simple Young tableaux referred to as the marginally large tableaux, for finite dimensional simple Lie algebras. Using this result, we present an explicit description of the crystal B(${\lambda}$), in terms of the marginally large tableaux, for the $G_2$ Lie algebra type. We also provide a new description of B(${\lambda}$), in terms of Nakajima monomials, that is in natural correspondence with our tableau description.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.73-82
• /
• 2016

The utility of exponential generating functions is that they are relevant for combinatorial problems involving sets and subsets. Sequences of polynomials play a fundamental role in applied mathematics, such sequences can be described using the exponential generating functions. The actuarial polynomials ${\alpha}^{({\beta})}_n(x)$, n = 0, 1, 2, ${\cdots}$, which was suggested by Toscano, have the following exponential generating function: $${\limits\sum^{\infty}_{n=0}}{\frac{{\alpha}^{({\beta})}_n(x)}{n!}}t^n={\exp}({\beta}t+x(1-e^t))$$. A linear functional on polynomial space can be identified with a formal power series. The set of formal power series is usually given the structure of an algebra under formal addition and multiplication. This algebra structure, the additive part of which agree with the vector space structure on the space of linear functionals, which is transferred from the space of the linear functionals. The algebra so obtained is called the umbral algebra, and the umbral calculus is the study of this algebra. In this paper, we investigate some umbral representations in the actuarial polynomials.

• Journal of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.109-132
• /
• 2024

The Clifford algebra of a direct sum of real quadratic spaces appears as the superalgebra tensor product of the Clifford algebras of the summands. The purpose of the current paper is to present a purely settheoretical version of the superalgebra tensor product which will be applicable equally to groups or to their non-associative analogues - quasigroups and loops. Our work is part of a project to make supersymmetry an effective tool for the study of combinatorial structures. Starting from group and quasigroup structures on four-element supersets, our superproduct unifies the construction of the eight-element quaternion and dihedral groups, further leading to a loop structure which hybridizes the two groups. All three of these loops share the same character table.

• Research in Mathematical Education
• /
• v.8 no.3
• /
• pp.215-226
• /
• 2004

The purpose of this paper is to introduce an activity of student who found purely linear algebraic solution of the Blackout puzzle. It shows how we can help and work with gifted students. It deals with algorithm, mathematical modeling, optimal solution and software.

• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.177-193
• /
• 2010

Working with the various special functions of mathematical physics and applied mathematics we often encounter inverse relations of the type $F_n(x)=\sum\limits_{k=0}^{n}A^n_kG_k(x)$ and $ G_n(x)=\sum\limits_{k=0}^{n}B_k^nF_k(x)$, where 0, 1, 2,$\cdots$. Here $F_n(x)$, $G_n(x)$ denote special polynomial functions, and $A_k^n$, $B_k^n$ denote coefficients found by use of the orthogonal properties of $F_n(x)$ and $G_n(x)$, or by skillful series manipulations. Typically $G_n(x)=x^n$ and $F_n(x)=P_n(x)$, the n-th Legendre polynomial. We give a collection of inverse series pairs of the type $f(n)=\sum\limits_{k=0}^{n}A_k^ng(k)$ if and only if $g(n)=\sum\limits_{k=0}^{n}B_k^nf(k)$, each pair being based on some reasonably well-known special function. We also state and prove an interesting generalization of a theorem of Rainville in this form.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.