Ompactification of Completely Regular Frames based on their Cozero Part
Authors
Abstract:
Let L be a frame. We denoted the set of all regular ideals of cozL by rId(cozL) . The aim of this paper is to study these ideals. For a frame L , we show that rId(cozL) is a compact completely regular frame and the map jc : rId(cozL)→L given by jc (I)=⋁I is a compactification of L which is isomorphism to its Stone–Čech compactification and is proved that jc have a right adjoint rc : L → rId(cozL) , given by rc(a)={x∈cozL : x≺≺a}. Moreover we identify prime and compact elements of rId(cozL) and we investigate the relation between regular ideals of cozL and P-frames. In addition it is shown that a frame L is a P-frame if and only if any ideal of cozL is regular../files/site1/files/51/%D8%B9%D8%A7%D8%A8%D8%AF%DB%8C.pdf
similar resources
On Completely Regular Ternary Semiring
We introduce and study the notion of a completely regular ternary semiring. Necessary and sufficient conditions for a ternary semiring to be completely regular are furnished. AMS Mathematics Subject Classification (2010): 16Y30, 16Y99
full textNew completely regular q-ary codes based on Kronecker products
For any integer ρ ≥ 1 and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d = 3 and with covering radius ρ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius ρ,...
full textOn Free Products of Completely Regular Semigroups
The free product CR S i of an arbitrary family of disjoint completely simple semigroups fS i g i2I , within the variety CR of completely regular semigroups, is described by means of a theorem generalizing that of Ka dourek and Poll ak for free completely regular semigroups. A notable consequence of the description is that all maximal subgroups of CR S i are free, except for those in the factors...
full textOn non-antipodal binary completely regular codes
Binary non-antipodal completely regular codes are characterized. Using the result on nonexistence of nontrivial binary perfect codes, it is concluded that there are no unknown nontrivial non-antipodal completely regular binary codes with minimum distance d ≥ 3. The only such codes are halves and punctered halves of known binary perfect codes. Thus, new such codes with covering radiuses ρ = 2, 3...
full textOn nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
full textArithmetic completely regular codes
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these “arithmetic completely regular codes”, we focus on cartesian products of completely regular codes and products of their ...
full textMy Resources
Journal title
volume 5 issue 1
pages 53- 66
publication date 2019-08
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023