• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.983-989
• /
• 2008

The purpose of this paper is to continue the investigation of monoids over which various properties of acts happen to coincide. Special concern is to characterize monoids by regular right acts. In particular there are given some characterizations of monoids over which all right acts that satisfy condition (E)(or condition (P)) are regular.

• 대한수학회논문집
• /
• 제37권3호
• /
• pp.669-679
• /
• 2022

We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating sets satisfy the finite factorization property, while positive monoids with co-well-ordered generating sets satisfy this property if and only if they satisfy the bounded factorization property.

• 대한수학회논문집
• /
• 제35권4호
• /
• pp.1057-1073
• /
• 2020

In this paper, we study some of the factorization aspects of rational multicyclic monoids, that is, additive submonoids of the nonnegative rational numbers generated by multiple geometric sequences. In particular, we provide a complete description of the rational multicyclic monoids M that are hereditarily atomic (i.e., every submonoid of M is atomic). Additionally, we show that the sets of lengths of certain rational multicyclic monoids are finite unions of multidimensional arithmetic progressions, while their unions satisfy the Structure Theorem for Unions of Sets of Lengths. Finally, we realize arithmetic progressions as the sets of distances of some additive submonoids of the nonnegative rational numbers.

• 대한수학회지
• /
• 제60권6호
• /
• pp.1255-1302
• /
• 2023

We study various aspects of the structure and representation theory of singular Artin monoids. This includes a number of generalizations of the desingularization map and explicit presentations for certain finite quotient monoids of diagrammatic nature. The main result is a categorification of the classical desingularization map for singular Artin monoids associated to finite Weyl groups using BGG category 𝒪.

• Korean Journal of Mathematics
• /
• 제27권2호
• /
• pp.535-545
• /
• 2019

The main idea of this paper is to introduce the notion of $cat^1$-monoids and to prove that the category of crossed semimodules ${\mathcal{C}}=(A,B,{\partial})$ where A is a group is equivalent to the category of $cat^1$-monoids. This is a generalization of the well known equivalence between category of $cat^1$-groups and that of crossed modules over groups.

• 대한수학회논문집
• /
• 제39권1호
• /
• pp.259-266
• /
• 2024

The purpose of this note is a wide generalization of the topological results of various classes of ideals of rings, semirings, and modules, endowed with Zariski topologies, to r-strongly irreducible r-ideals (endowed with Zariski topologies) of monoids, called terminal spaces. We show that terminal spaces are T₀, quasi-compact, and every nonempty irreducible closed subset has a unique generic point. We characterize rarithmetic monoids in terms of terminal spaces. Finally, we provide necessary and sufficient conditions for the subspaces of r-maximal r-ideals and r-prime r-ideals to be dense in the corresponding terminal spaces.

• 대한수학회보
• /
• 제46권3호
• /
• pp.489-498
• /
• 2009

We obtain two new characterizations of separativity of refinement monoids, in terms of comparability-type conditions. As applications, we get several equivalent conditions of separativity for exchange ideals.

• Korean Journal of Mathematics
• /
• 제20권4호
• /
• pp.423-431
• /
• 2012

There have been some study characterizing monoids by homological classification using the properties around projectivity, injectivity, or regularity of acts. In particular Kilp and Knauer([4]) have analyzed monoids over which all acts with one of the properties around projectivity or injectivity are regular. However Kilp and Knauer left over problems of characterization of monoids over which all regular right S-acts are (weakly) at, (weakly) injective or faithful. Among these open problems, Liu([3]) proved that all regular right S-acts are (weakly) at if and only if es is a von Neumann regular element of S for all $s{\in}S$ and $e^2=e{\in}T$, and that all regular right S-acts are faithful if and only if all right ideals eS, $e^2=e{\in}T$, are faithful. But it still remains an open question to characterize over which all regular right S-acts are weakly injective or injective. Hence the purpose of this study is to investigate the relations between regular right S-acts and weakly injective right S-acts, and then characterize the monoid over which all regular right S-acts are weakly injective.

• 대한수학회논문집
• /
• 제39권2호
• /
• pp.313-329
• /
• 2024

An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of atoms (counting repetitions) in the corresponding sum is called the length of the factorization. Following Geroldinger and Zhong, we say that an atomic monoid M is a length-finite factorization monoid if each b ∈ M has only finitely many factorizations of any prescribed length. An additive submonoid of ℝ_≥0 is called a positive monoid. Factorizations in positive monoids have been actively studied in recent years. The main purpose of this paper is to give a better understanding of the non-unique factorization phenomenon in positive monoids through the lens of the length-finite factorization property. To do so, we identify a large class of positive monoids which satisfy the length-finite factorization property. Then we compare the length-finite factorization property to the bounded and the finite factorization properties, which are two properties that have been systematically investigated for more than thirty years.

• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.93-103
• /
• 2021

In this paper I am considering several cryptological threads. The problem of the RSA cipher, like the Diffie-Hellman protocol, is the use of finite sets. In this paper, I generalize the RSA cipher and DH protocol for infinite sets using monoids. In monoids we can not find the inverse, which makes it difficult. In the second part of the paper I show the applications in cryptology of polynomial composites and monoid domains. These are less known structures. In this work, I show different ways of encrypting messages based on infinite sets.