In this paper, the ordered set of rough sets determined by a quasiorder relation R is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different kinds of complementation operations, and we describe its completely join-irreducible elements. We also characterize the case in which this lattice is a Stone ...

For a presentation A of a transversal matroid M , we study the ordered set TA of single-element transversal extensions of M that have presentations that extend A; extensions are ordered by the weak order. We show that TA is a distributive lattice, and that each finite distributive lattice is isomorphic to TA for some presentation A of some transversal matroid M . We show that TA ∩ TB, for any t...

In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of 2D-gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a 2D-gon is the disjoint union of distributive lattices which we describe. We also discuss...

Qualitative calculi play a central role in representing and reasoning about qualitative spatial and temporal knowledge. This paper studies distributive subalgebras of qualitative calculi, which are subalgebras in which (weak) composition distributives over nonempty intersections. It has been proven for RCC5 and RCC8 that path consistent constraint network over a distributive subalgebra is alway...

Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This generalizes the well-known given by Birkhoff lattices posets. We also study concepts of dual atoms, boolean elements, complemented elements and irreducible elements. prove that sets form semi-boolean algebras. show set lattice lattice.

In 2001, an open question that was posed by Blyth, Silva and Varlet in [2] is the following: for an Ockham algebra L determine the congruences on L that are kernels of endomorphisms on L. Whereas a general solution to this is stll an open problem, there has been some progress in investigating kernels of endomorphisms in various lattice-ordered algebras. In this connection, an algebra A is said ...

This work focuses on lattice-theoretical foundations of rough set theory. It consists of the following sections: 1: Introduction 2: Basic Notions and Notation, 3: Orders and Lattices, 4: Distributive, Boolean, and Stone Lattices, 5: Closure Systems and Topologies, 6: Fixpoints and Closure Operators on Ordered Sets, 7: Galois Connections and Their Fixpoints, 8: Information Systems, 9: Rough Set ...

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In particular, we show that the set of these partitions can be ordered in a natural way which gives the distributive lattice structure to this set. We also giv...

Derivative lattices associated with partially ordered linear spaces over skew fields are considered. Properties of the convex projective geometry $$ \mathcal{L} for a space FV field F investigated. The convexity subspaces means Abelian (ab-convexity), which is based on definition subgroup group. It shown that ab-convex directed plays theory same role as subgroups groups. We obtain element-wise ...