Distributive Lattices of λ-simple Semirings

author

  • T. Mondal Department of Mathematics Dr. Bhupendra Nath Duta Smriti Mahavidyalaya, Hatgobindapur, Burdwan - 713407, West Bengal, India
Abstract:

In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transitivity of $stackrel{l}{longrightarrow}$ yields an expanding family {$stackrel{l}{longrightarrow^n}}$ of binary relations which associate subsets $Lambda_n(a)$ for all $a in S$, which again induces an equivalence relation $lambda_n$. We also define $lambda(lambda_n)$-simple semirings, and characterize the semirings which are distributive lattices of $lambda(lambda_n)$-simple semirings.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

“ Complete - Simple ” Distributive Lattices

It is well known that the only simple distributive lattice is the twoelement chain. We can generalize the concept of a simple lattice to complete lattices as follows: a complete lattice is complete-simple if it has only the two trivial complete congruences. In this paper we show the existence of infinite complete-simple distributive lattices. “COMPLETE-SIMPLE” DISTRIBUTIVE LATTICES G. GRÄTZER A...

full text

Another Construction of Complete-simple Distributive Lattices

It is well known that the only simple distributive lattice is the twoelement chain. In an earlier paper, we introduced the concept of a completesimple lattice, and proved the existence of infinite complete-simple distributive lattices. In this paper we provide a new proof which is easier to visualize.

full text

Conditionally distributive real semirings

A characterization of all pairs (U,S) where is U left-continuous uninorms with neutral element e from (0,1] and S countinuous t-conorms satisfying distributivity of U over S ( socalled conditional distributivity) is given.

full text

The Variety of Semirings Generated by Distributive Lattices and Finite Fields

A semiring variety is d-semisimple if it is generated by the distributive lattice of order two and a finite number of finite fields. A d-semisimple variety V = HSP{B2, F1, . . . , Fk} plays the main role in this paper. It will be proved that it is finitely based, and that, up to isomorphism, the two-element distributive lattice B2 and all subfields of F1, . . . , Fk are the only subdirectly irr...

full text

Simple and subdirectly irreducibles bounded distributive lattices with unary operators

Distributive lattices with operators (DLO) are a natural generalization of the notion of Boolean algebras with operators. An operator in a bounded distributive lattice A is a function f : An → A which preserves ∧ (or ∨) in each coordinate. In the last few years these classes of algebras have been actively investigated since they appear as algebraic counterpart of many logics. Some important con...

full text

Distributive Lattices and Cohomology

A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of modules over Dedekind rings. A generalized Chinese remainder theorem is derived as a consequence of the above resolution. The GelfandNaimark duality between finit...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 17  issue 1

pages  47- 55

publication date 2022-04

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023