Clean semiring

被引:1
|
作者
Kar, S. [1 ]
Das, D. [1 ]
机构
[1] Jadavpur Univ, Dept Math, 188 Raja SC Mallick Rd, Kolkata 700032, India
来源
BEITRAGE ZUR ALGEBRA UND GEOMETRIE-CONTRIBUTIONS TO ALGEBRA AND GEOMETRY | 2023年 / 64卷 / 01期
关键词
Clean semiring; Strongly clean semiring; Exchange semiring; Antisimple semiring; RINGS;
D O I
10.1007/s13366-022-00628-0
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we introduce the concept of clean semiring as a generalization of clean ring. A semiring is said to be clean if its every nonzero element can be written as the sum of an idempotent and a unit. We study the notion of clean semiring and obtain some important characterizations of clean semiring. We also study the notion of exchange semiring and find out the connenction between clean semiring and exchange semiring.
引用
收藏
页码:197 / 207
页数:11
相关论文
共 50 条
  • [31] T - SEMIRING PAIRS
    Jun, Jaiung
    Mincheva, Kalina
    Rowen, Louis
    KYBERNETIKA, 2022, 58 (05) : 733 - 759
  • [32] The endomorphism semiring of a semilattice
    J. Ježek
    T. Kepka
    M. Maróti
    Semigroup Forum, 2009, 78 : 21 - 26
  • [33] On pseudovarieties of semiring homomorphisms
    Polák, L
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 635 - 647
  • [34] Commuting regular Γ-semiring
    Krishnamoorthy, S.
    Arul Doss, R.
    International Journal of Computational and Mathematical Sciences, 2010, 4 (08): : 376 - 378
  • [35] On the Jacobson radical of a semiring
    Bhuniya, A. K.
    Sarkar, Puja
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2024,
  • [36] ON SEMIRING COMPLEXITY OF SCHUR POLYNOMIALS
    Fomin, Sergey
    Grigoriev, Dima
    Nogneng, Dorian
    Schost, Eric
    COMPUTATIONAL COMPLEXITY, 2018, 27 (04) : 595 - 616
  • [37] RELATION BETWEEN LATTICE AND SEMIRING
    Chowdhury, Kanak Ray
    Sultana, Abeda
    Mitra, Nirmal Kanti
    Khan, A. F. M. Khodadad
    JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES, 2014, 9 (01): : 1341 - 1356
  • [38] On semiring complexity of Schur polynomials
    Sergey Fomin
    Dima Grigoriev
    Dorian Nogneng
    Éric Schost
    computational complexity, 2018, 27 : 595 - 616
  • [39] On a problem related to idempotent semiring
    Zhao, X.Z.
    Lanzhou Daxue Xuebao/Journal of Lanzhou University, 2001, 37 (01):
  • [40] Connectivity of Semiring Valued Graphs
    Santra, Shyam Sundar
    Victor, Prabhakaran
    Chandramouleeswaran, Mahadevan
    El-Nabulsi, Rami Ahmad
    Khedher, Khaled Mohamed
    Govindan, Vediyappan
    SYMMETRY-BASEL, 2021, 13 (07):