The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper, we study and characterize some properties of a given binary operation on a lattice. More specifically, we show necessary and sufficient conditions under which a binary operation on a lattice coincides with its meet (resp. its join) operation. Importantly, we construct two new posets based on a given binary operation on a lattice and investigate some cases that these two posets have a lattice structure. Moreover, we provide some representations of a given lattice based on these new...
We introduce the concept of a pseudo-Kleene algebra which is a non-distributive modification of a Kleene algebra introduced by J. A. Kalman [Kalman, J. A.: Lattices with involution. Trans. Amer. Math. Soc. 87 (1958), 485–491.]. Basic properties of pseudo-Kleene algebras are studied. For pseudo-Kleene algebras with a fix-point there are determined subdirectly irreducible members.
In this paper we survey results and open problems on the structure of additive and hereditary properties of graphs. The important role of vertex partition problems, in particular the existence of uniquely partitionable graphs and reducible properties of graphs in this structure is emphasized. Many related topics, including questions on the complexity of related problems, are investigated.
Currently displaying 1 –
20 of
293