AbstractWe study a class of lattices called weak*complemented lattices which are shown to have the property that the order complex of any interval of the lattice is either contractible or homotopy equivalent to a sphere. The two main examples are lattices generated by intervals in a total order and the lattices of partitions of integers under dominance order. The proofs are done mainly using homotopy complementation formulas for lattices and with a method called B-labeling. We also show that a class of lattices called Greene lattices are either contractible or spherical. Lattices generated by multisets are also discussed
AbstractIt is proved that the completion of a complemented modular lattice with respect to a Hausdor...
summary:We characterize lattices with a complemented tolerance lattice. As an application of our res...
This study investigates the relation between partition of a lattice into convex sublattices and the ...
AbstractWe study a class of lattices called weak*complemented lattices which are shown to have the p...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
Smarandache groupoid ( Zp,!J.) is not partly ordered under Smarandache inclusion relation but it con...
AbstractIn Part I of this paper, we introduced a method of making two isomorphic intervals of a boun...
18 pages, 12 figuresInternational audienceWe define and study the canonical complex of a finite semi...
AbstractBipartitional relations were introduced by Foata and Zeilberger in their characterization of...
Smarandache groupoid is not partly ordered under Smarandache inclusion relation but it contains some...
International audienceWe study the canonical complex of a finite semidistributive lattice L, a simpl...
Intervals in binary or n-ary relations or other discrete structures generalize the concept of an int...
The class of uniquely complemented lattices properly contains all Boolean lattices. However, no expl...
Intervals in binary or n-ary relations or other discrete structures generalize the concept of an int...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
AbstractIt is proved that the completion of a complemented modular lattice with respect to a Hausdor...
summary:We characterize lattices with a complemented tolerance lattice. As an application of our res...
This study investigates the relation between partition of a lattice into convex sublattices and the ...
AbstractWe study a class of lattices called weak*complemented lattices which are shown to have the p...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
Smarandache groupoid ( Zp,!J.) is not partly ordered under Smarandache inclusion relation but it con...
AbstractIn Part I of this paper, we introduced a method of making two isomorphic intervals of a boun...
18 pages, 12 figuresInternational audienceWe define and study the canonical complex of a finite semi...
AbstractBipartitional relations were introduced by Foata and Zeilberger in their characterization of...
Smarandache groupoid is not partly ordered under Smarandache inclusion relation but it contains some...
International audienceWe study the canonical complex of a finite semidistributive lattice L, a simpl...
Intervals in binary or n-ary relations or other discrete structures generalize the concept of an int...
The class of uniquely complemented lattices properly contains all Boolean lattices. However, no expl...
Intervals in binary or n-ary relations or other discrete structures generalize the concept of an int...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
AbstractIt is proved that the completion of a complemented modular lattice with respect to a Hausdor...
summary:We characterize lattices with a complemented tolerance lattice. As an application of our res...
This study investigates the relation between partition of a lattice into convex sublattices and the ...