On a problem of Kertesz and Stern
On algebraic lattices and semisimple algebras
On central relations of complete lattices
On centrally symmetric graphs
In this note we extend results on the covering graphs of modular lattices (Zelinka) and semimodular lattices (Gedeonova, Duffus and Rival) to the covering graph of certain graded lattices.
On complemented strong lattices
On distances and metrics in discrete ordered sets
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality and restrictions of the distance to finite chains may or may not coincide with the natural, difference-of-height distance measured in a chain. It is shown that for semilattices the semimodularity ensures the good behaviour of the distances considered. The Jordan-Dedekind chain condition, which is weaker than semimodularity, is equivalent to the...
On interval decomposition lattices
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in an ordered set. They are defined abstractly as closed sets of a closure system on a set V, satisfying certain axioms. Decompositions are partitions of V whose blocks are intervals, and they form an algebraic semimodular lattice. Lattice-theoretical properties of decompositions are explored, and connections with particular types of intervals are established.
On semimodular lattices of generating systems
On strong semimodular lattices III
On The Essential Flats Of Geometric Lattices
On the essential of geometric lattices.
On the Kurosh-Ore replacement property