Lattices of lower finite breadth.
We consider general properties of lattices of relative colour-families and antivarieties. Several results generalise the corresponding assertions about colour-families of undirected loopless graphs, see [1]. Conditions are indicated under which relative colour-families form a lattice. We prove that such a lattice is distributive. In the class of lattices of antivarieties of relation structures of finite signature, we distinguish the most complicated (universal) objects. Meet decompositions in lattices...
A dcpo is continuous if and only if the lattice of all Scott-closed subsets of is completely distributive. However, in the case where is a non-continuous dcpo, little is known about the order structure of . In this paper, we study the order-theoretic properties of for general dcpo’s . The main results are: (i) every is C-continuous; (ii) a complete lattice is isomorphic to for a complete semilattice if and only if is weak-stably C-algebraic; (iii) for any two complete semilattices...
We characterize lattices with a complemented tolerance lattice. As an application of our results we give a characterization of bounded weakly atomic modular lattices with a Boolean tolerance lattice.
There are investigated classes of finite bands such that their subsemigroup lattices satisfy certain lattice-theoretical properties which are related with the cardinalities of the Green’s classes of the considered bands, too. Mainly, there are given disjunctions of equations which define the classes of finite bands.
Deux codages sont utilisés sur l’ensemble des permutations ou ordres totaux sur un ensemble fini à éléments et à chacun de ces codages est associé un produit direct d’ordres totaux. On démontre que le diagramme du treillis permutoèdre (ou ordre de Bruhat faible sur le groupe symétrique ) est intersection des diagrammes des deux produits directs de ordres totaux à éléments.
La structure d’opérade anticyclique de l’opérade dendriforme donne en particulier une matrice d’ordre agissant sur l’espace engendré par les arbres binaires plans à feuilles. On calcule le polynôme caractéristique de cette matrice. On propose aussi une conjecture compatible pour le polynôme caractéristique de la transformation de Coxeter du poset de Tamari, qui est essentiellement une racine carrée de cette matrice.
Uninorms are important generalizations of triangular norms and conorms, with a neutral element lying anywhere in the unit interval, and left (right) semi-uninorms are non-commutative and non-associative extensions of uninorms. In this paper, we firstly introduce the concepts of left and right semi-uninorms on a complete lattice and illustrate these notions by means of some examples. Then, we lay bare the formulas for calculating the upper and lower approximation left (right) semi-uninorms of a binary...