• 제목/요약/키워드: semiring

검색결과 69건 처리시간 0.024초

ON WEAKLY COMPLETELY QUASI PRIMARY AND COMPLETELY QUASI PRIMARY IDEALS IN TERNARY SEMIRINGS

  • Yiarayong, Pairote
    • 대한수학회논문집
    • /
    • 제31권4호
    • /
    • pp.657-665
    • /
    • 2016
  • In this investigation we studied completely quasi primary and weakly completely quasi primary ideals in ternary semirings. Some characterizations of completely quasi primary and weakly completely quasi primary ideals were obtained. Moreover, we investigated relationships between completely quasi primary and weakly completely quasi primary ideals in ternary semirings. Finally, we obtained necessary and sufficient conditions for a weakly completely quasi primary ideal to be a completely quasi primary ideal.

ON COMMUTING CONDITIONS OF SEMIRINGS WITH INVOLUTION

  • LIAQAT ALI;MUHAMMAD ASLAM;MAWAHIB ELAMIN;HUDA UONES MOHAMED AHAMD;NEWMA YAHIA;LAXMI RATHOUR
    • Journal of applied mathematics & informatics
    • /
    • 제42권2호
    • /
    • pp.417-432
    • /
    • 2024
  • In this research article, we study a class of semirings with involution. Differential identities involving two or three derivations of a semiring with second kind involution are investigated. It is analyzed that how these identities, with a special role for second kind involution, bring commutativity to semirings.

Column ranks and their preservers of general boolean matrices

  • Song, Seok-Zun;Lee, Sang-Gu
    • 대한수학회지
    • /
    • 제32권3호
    • /
    • pp.531-540
    • /
    • 1995
  • There is much literature on the study of matrices over a finite Boolean algebra. But many results in Boolean matrix theory are stated only for binary Boolean matrices. This is due in part to a semiring isomorphism between the matrices over the Boolean algebra of subsets of a k element set and the k tuples of binary Boolean matrices. This isomorphism allows many questions concerning matrices over an arbitrary finite Boolean algebra to be answered using the binary Boolean case. However there are interesting results about the general (i.e. nonbinary) Boolean matrices that have not been mentioned and they differ somwhat from the binary case.

  • PDF

LINEAR PRESERVERS OF SYMMETRIC ARCTIC RANK OVER THE BINARY BOOLEAN SEMIRING

  • Beasley, LeRoy B.;Song, Seok-Zun
    • 대한수학회지
    • /
    • 제54권4호
    • /
    • pp.1317-1329
    • /
    • 2017
  • A Boolean rank one matrix can be factored as $\text{uv}^t$ for vectors u and v of appropriate orders. The perimeter of this Boolean rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A Boolean matrix of Boolean rank k is the sum of k Boolean rank one matrices, a rank one decomposition. The perimeter of a Boolean matrix A of Boolean rank k is the minimum over all Boolean rank one decompositions of A of the sums of perimeters of the Boolean rank one matrices. The arctic rank of a Boolean matrix is one half the perimeter. In this article we characterize the linear operators that preserve the symmetric arctic rank of symmetric Boolean matrices.

STRUCTURES OF IDEMPOTENT MATRICES OVER CHAIN SEMIRINGS

  • Kang, Kyung-Tae;Song, Seok-Zun;Yang, Young-Oh
    • 대한수학회보
    • /
    • 제44권4호
    • /
    • pp.721-729
    • /
    • 2007
  • In this paper, we have characterizations of idempotent matrices over general Boolean algebras and chain semirings. As a consequence, we obtain that a fuzzy matrix $A=[a_{i,j}]$ is idempotent if and only if all $a_{i,j}$-patterns of A are idempotent matrices over the binary Boolean algebra $\mathbb{B}_1={0,1}$. Furthermore, it turns out that a binary Boolean matrix is idempotent if and only if it can be represented as a sum of line parts and rectangle parts of the matrix.

On Partitioning and Subtractive Subsemimodules of Semimodules over Semirings

  • Chaudhari, Jaiprakash Ninu;Bond, Dipak Ravindra
    • Kyungpook Mathematical Journal
    • /
    • 제50권2호
    • /
    • pp.329-336
    • /
    • 2010
  • In this paper, we introduce a partitioning subsemimodule of a semimodule over a semiring which is useful to develop the quotient structure of semimodule. Indeed we prove : 1) The quotient semimodule M=N(Q) is essentially independent of choice of Q. 2) If f : M ${\rightarrow}$ M' is a maximal R-semimodule homomorphism, then $M/kerf_{(Q)}\;\cong\;M'$. 3) Every partitioning subsemimodule is subtractive. 4) Let N be a Q-subsemimodule of an R-semimodule M. Then A is a subtractive subsemimodule of M with $N{\subseteq}A$ if and only if $A/N_{(Q{\cap}A)}\;=\;\{q+N:q{\in}Q{\cap}A\}$ is a subtractive subsemimodule of $M/N_{(Q)}$.

One-sided Prime Ideals in Semirings

  • Shabir, Muhammad;Iqbal, Muhammad Sohail
    • Kyungpook Mathematical Journal
    • /
    • 제47권4호
    • /
    • pp.473-480
    • /
    • 2007
  • In this paper we define prime right ideals of semirings and prove that if every right ideal of a semiring R is prime then R is weakly regular. We also prove that if the set of right ideals of R is totally ordered then every right ideal of R is prime if and only if R is right weakly regular. Moreover in this paper we also define prime subsemimodule (generalizing the concept of prime right ideals) of an R-semimodule. We prove that if a subsemimodule K of an R-semimodule M is prime then $A_K(M)$ is also a prime ideal of R.

  • PDF

𝜙-prime Subsemimodules of Semimodules over Commutative Semirings

  • Fatahi, Fatemeh;Safakish, Reza
    • Kyungpook Mathematical Journal
    • /
    • 제60권3호
    • /
    • pp.445-453
    • /
    • 2020
  • Let R be a commutative semiring with identity and M be a unitary R-semimodule. Let 𝜙 : 𝒮(M) → 𝒮(M) ∪ {∅} be a function, where 𝒮(M) is the set of all subsemimodules of M. A proper subsemimodule N of M is called 𝜙-prime subsemimodule, if r ∈ R and x ∈ M with rx ∈ N \𝜙(N) implies that r ∈ (N :R M) or x ∈ N. So if we take 𝜙(N) = ∅ (resp., 𝜙(N) = {0}), a 𝜙-prime subsemimodule is prime (resp., weakly prime). In this article we study the properties of several generalizations of prime subsemimodules.

A WEAKER NOTION OF THE FINITE FACTORIZATION PROPERTY

  • Henry Jiang;Shihan Kanungo;Hwisoo Kim
    • 대한수학회논문집
    • /
    • 제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.