Wyniki wyszukiwania - BazTech

Ograniczanie wyników

5 Demonstratio Mathematica

Znaleziono wyników: 5

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Green's relations

Sortuj według:

Ogranicz wyniki do:

Green’s relations in the commutative centralizers of monounary algebras

Jakubíková-Studenovská D., Šuličová M.

Demonstratio Mathematica

2015

Vol. 48, nr 4

536--545

The paper deals with the monounary algebras for which the second centralizer equals the first centralizer. We describe Green’s relations on the semigroup C, where C is the centralizer of such algebra.

On the coset category of a skew lattice

Pita-Costa J.

Demonstratio Mathematica

2014

Vol. 47, nr 3

539--554

Skew lattices are noncommutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper, we will look at the category determined by these rectangular algebras and the morphisms between them, showing that not all skew lattices can determine such a category. Furthermore, we will present a class of examples of skew lattices in rings that are not strictly categorical, and present sufficient conditions for skew lattices of matrices in rings to constitute ^-distributive skew lattices.

Erratum to : On the coset structure of a skew lattice

Pita Costa J.

Demonstratio Mathematica

2013

Vol. 46, nr 2

245--246

On the coset structure of a skew lattice

Pita-Costa J.

Demonstratio Mathematica

2011

Vol. 44, nr 4

673-692

The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of sets where the Green's relation D is a congruence describing an adjunction to the category of lattices. In this paper we will discuss the relevance of this approach, revisit some known decompositions and relate the order structure of a skew lattice with its coset structure that describes the internal coset decomposition of the respective skew lattice.

Regular elements and Green's relations in power Menger algebras of terms

Denecke K., Glubudom P.

Demonstratio Mathematica

2008

Vol. 41, nr 1

11-22

Sets of terms of type r are called tree languages (see [5]). On sets of tree languages superposition operations can be defined in such a way that the collection of all tree languages of type r forms an abstract clone. Considering only sets of n-ary terms one obtains a Menger algebra (see e.g. [3]). From the superposition operations binary operations on tree languages can be derived. For the corresponding sernigroups of tree languages we study idempotent and regular elements as well as Green's relations L and R.