• 대한수학회지
• /
• 제56권5호
• /
• pp.1159-1172
• /
• 2019

A semigroup S is called a weakly abundant semigroup if its every $\tilde{\mathcal{L}}$-class and every $\tilde{\mathcal{R}}$-class contains an idempotent. Our purpose is to study an analogue of orthodox semigroups in the class of weakly abundant semigroups. Such an analogue is called a left quasi-abundant semigroup, which is a weakly abundant semigroup with a left quasi-normal band of idempotents and having the congruence condition (C). To build our main structure theorem for left quasi-abundant semigroups, we first give a sufficient and necessary condition of the idempotent set E(S) of a weakly abundant semigroup S being a left quasi-normal band. And then we construct a left quasi-abundant semigroup in terms of weak spined products. Such a result is a generalisation of that of Guo and Shum for left semi-perfect abundant semigroups. In addition, we consider a type Q semigroup which is a left quasi-abundant semigroup having the PC condition.

• Korean Journal of Mathematics
• /
• 제17권2호
• /
• pp.189-196
• /
• 2009

Let D be an integral domain, and let U be a group of units of D. Let $D^*=D-\{0\}$ and ${\Gamma}=D^*/U$ be the commutative cancellative semigroup under aU+bU=abU. We prove that $Cl(D)=Cl({\Gamma})$ and that D is a PvMD (resp., GCD-domain, Mori domain, Krull domain, factorial domain) if and only if ${\Gamma}$ is a PvMS(resp., GCD-semigroup, Mori semigroup, Krull semigroup, factorial semigroup). Let U=U(D) be the group of units of D. We also show that if D is integrally closed, then $D[{\Gamma}]$, the semigroup ring of ${\Gamma}$ over D, is an integrally closed domain with $Cl(D[{\Gamma}])=Cl(D){\oplus}Cl(D)$; hence D is a PvMD (resp., GCD-domain, Krull domain, factorial domain) if and only if $D[{\Gamma}]$ is.

• 대한수학회보
• /
• 제41권1호
• /
• pp.189-198
• /
• 2004

In this study we consider quantum dynamical semi-group with a normal faithful invariant state. A quantum dynamical semigroup $\alpha\;=\;\{{\alpha}_t\}_{t{\geq}0}$ is a class of linear normal identity-preserving mappings on a von Neumann algebra M with semigroup property and some positivity condition. We investigate the asymptotic behaviors of the semigroup such as ergodicity or mixing properties in terms of their eigenvalues under the assumption that the semigroup satisfies positivity. This extends the result of [13] which is obtained under the assumption that the semi group satisfy 2-positivity.

• Korean Journal of Mathematics
• /
• 제27권1호
• /
• pp.53-62
• /
• 2019

Recently, an infinite class of finitely based finite involution semigroups with non-finitely based semigroup reducts have been found. In contrast, only one example of the opposite type-non-finitely based finite involution semigroups with finitely based semigroup reducts-has so far been published. In the present article, a sufficient condition is established under which an involution semigroup is non-finitely based. This result is then applied to exhibit several examples of the desired opposite type.

• 대한수학회논문집
• /
• 제21권3호
• /
• pp.577-586
• /
• 2006

In this paper we will propose the methods for finding the non-invertible ideals corresponding to non-primitive quadratic forms and clarify the structures of class SEMIGROUPS of imaginary quadratic orders which were given by Zanardo and Zannier [8], and we will give a general algorithm for calculating power of ideals/classes via the Dirichlet composition of quadratic forms which is applicable to cryptography in the class semigroup of imaginary quadratic non-maximal order and revisit the cryptosystem of Kim and Moon [5] using a Zanardo and Zannier [8]'s quantity as their secret key, in order to analyze Jacobson [7]'s revised cryptosystem based on the class semigroup which is an alternative of Kim and Moon [5]'s.

• 한국전자통신학회논문지
• /
• 제6권1호
• /
• pp.90-96
• /
• 2011

본 논문에서는 비-최대 복소 이차 정수환(order)의 가역 이데알의 특성을 이용하는 암호계중에서 매우 중요한 이산대수문제(DLP)를 제안하고 그의 안전성을 분석하려고 한다. 우선 이러한 이산대수문제를 제안하게 된 수학적인 배경을 소개한 다음, Cls (O) 위에서 안전한 이산대수문제를 구축 한다. 또한 제안된 암호계의 안전성을 결정하는 최대 복소 이차 정수환의 류군(class group)의 류수(class number)와 비최대 류반군(class semigroup)의 류수를 비교하여 안전성이 증가하는 정도를 계산한다. 마지막으로 이데알의 소 이데알 인수분해과정에서 유일인수분해의 가능성 문제를 기반으로 최대 order의 류군(class group)위에서의 DLP와 비최대 류반군(class semigroup)위에서의 DLP를 비교하면서, 본 논문에서 제안된 DLP의 안전성을 검증하고자 한다.

• 대한수학회보
• /
• 제51권4호
• /
• pp.1217-1227
• /
• 2014

The intersection of all two-sided ideals of an ordered semigroup, if it is non-empty, is called the kernel of the ordered semigroup. A left ideal L of an ordered semigroup ($S,{\cdot},{\leq}$) having a kernel I is said to be simple if I is properly contained in L and for any left ideal L' of ($S,{\cdot},{\leq}$), I is properly contained in L' and L' is contained in L imply L' = L. The notions of simple right and two-sided ideals are defined similarly. In this paper, the author characterize when an ordered semigroup having a kernel is the class sum of its simple left, right and two-sided ideals. Further, the structure of simple two-sided ideals will be discussed.

• 대한수학회논문집
• /
• 제27권4호
• /
• pp.689-699
• /
• 2012

(S, *) is a semigroup S equipped with a unary operation "*". This work is devoted to a class of unary semigroups, namely E-$inversive$ *-$semigroups$. A unary semigroup (S, *) is called an E-inversive *-semigroup if the following identities hold: $$x^*xx^*=x^*$$, $$(x^*)^*=xx^*x$$, $$(xy)^*=y^*x^*$$. In this paper, E-inversive *-semigroups are characterized by several methods. Furthermore, congruences on these semigroups are also studied.

• 한국지능시스템학회논문지
• /
• 제16권3호
• /
• pp.338-348
• /
• 2006

We classify the 3-classes In the semigroup M$_5$(F) of all 5$\times$5 Boolean matrices over F=(0,1).

• 호남수학학술지
• /
• 제28권2호
• /
• pp.185-196
• /
• 2006

A scheme based on the cryptography for enforcing multilevel security in a system where hierarchy is represented by a partially ordered set was first introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. In 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment in order to overcome this shortage. In 2005, Kim et al. proposed key management systems for multilevel security using one-way hash function, RSA algorithm, Poset dimension and Clifford semigroup in the context of modern cryptography. In particular, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders is based on the fact that the computation of a key ideal $K_0$ from an ideal $EK_0$ seems to be difficult unless E is equivalent to O. We, in this paper, show that computing preimages under the bonding homomorphism is not difficult, and that the multilevel cryptosystem based on the Clifford semigroup is insecure and improper to the key management system.