• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.406-410
• /
• 2003

B. M. Schein([1]) considered systems of the form (${\Phi}$; ${\circ}$,-), where ${\Phi}$ is a set of functions closed under the composition "${\circ}$" of functions and the set theoretic subtraction "-". In this structure, (${\Phi}$; ${\circ}$) is a function semigroup and (${\Phi}$;-) is a subtraction algebra in the sense of [1]. He proved that every subtraction semigroup is isomorphic to a difference semigroup of invertible functions. Also this structure is closely related to the mathematical logic, Boolean algebra, Bck-algera, etc. In this paper, we define the near subtraction semigroup as a generalization of the subtraction semigroup, and define the notions of strong for it, and then we will search the general properties of this structure, the properties of ideals, and the application of it.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.571-594
• /
• 2022

Let D be an integral domain with quotient field K, Pic(D) be the ideal class group of D, and X be an indeterminate. A polynomial overring of D means a subring of K[X] containing D[X]. In this paper, we study almost Dedekind domains which are polynomial overrings of a principal ideal domain D, defined by the intersection of K[X] and rank-one discrete valuation rings with quotient field K(X), and their ideal class groups. Next, let ℤ be the ring of integers, ℚ be the field of rational numbers, and 𝔊f be the set of finitely generated abelian groups (up to isomorphism). As an application, among other things, we show that there exists an overring R of ℤ[X] such that (i) R is a Bezout domain, (ii) R∩ℚ[X] is an almost Dedekind domain, (iii) Pic(R∩ℚ[X]) = $\oplus_{G{\in}G_{f}}$ G, (iv) for each G ∈ 𝔊f, there is a multiplicative subset S of ℤ such that RS ∩ ℚ[X] is a Dedekind domain with Pic(RS ∩ ℚ[X]) = G, and (v) every invertible integral ideal I of R ∩ ℚ[X] can be written uniquely as I = XnQe11···Qekk for some integer n ≥ 0, maximal ideals Qi of R∩ℚ[X], and integers ei ≠ 0. We also completely characterize the almost Dedekind polynomial overrings of ℤ containing Int(ℤ).

• Korean Journal of Mathematics
• /
• v.22 no.1
• /
• pp.181-206
• /
• 2014

Let $R={\bigoplus}_{\alpha{\in}\Gamma}R_{\alpha}$ be a graded integral domain graded by an arbitrary grading torsionless monoid ${\Gamma}$, and ⋆ be a semistar operation on R. In this paper we define and study the graded integral domain analogue of ⋆-Nagata and Kronecker function rings of R with respect to ⋆. We say that R is a graded Pr$\ddot{u}$fer ⋆-multiplication domain if each nonzero finitely generated homogeneous ideal of R is ⋆$_f$-invertible. Using ⋆-Nagata and Kronecker function rings, we give several different equivalent conditions for R to be a graded Pr$\ddot{u}$fer ⋆-multiplication domain. In particular we give new characterizations for a graded integral domain, to be a $P{\upsilon}MD$.

• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.455-462
• /
• 2013

Let D be an integral domain, S be a saturated multi-plicative subset of D such that $D_S$ is a factorial domain, $\{X_{\alpha}\}$ be a nonempty set of indeterminates, and $D[\{X_{\alpha}\}]$ be the polynomial ring over D. We show that S is a splitting (resp., almost splitting, t-splitting) set in D if and only if every nonzero prime t-ideal of D disjoint from S is principal (resp., contains a primary element, is t-invertible). We use this result to show that $D{\backslash}\{0\}$ is a splitting (resp., almost splitting, t-splitting) set in $D[\{X_{\alpha}\}]$ if and only if D is a GCD-domain (resp., UMT-domain with $Cl(D[\{X_{\alpha}\}]$ torsion UMT-domain).

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.4
• /
• pp.605-610
• /
• 2013

A cryptography for enforcing hierarchic groups in a system where hierarchy is represented by a partially ordered set was introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. To overcome this shortage, in 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment. In 2005, Kim et al. proposed the key management systems for using one-way hash function, RSA algorithm, poset dimension and Clifford semigroup in the context of modern cryptography, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders. We, in this paper, show that Kim et al. cryptosystem is insecure in some reasons and propose a revised cryptosystem.