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.
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.
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...
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.
The aim of this paper is to present relations between Goldie, hollow and Kurosh-Ore dimensions of semimodular lattices. Relations between Goldie and Kurosh-Ore dimensions of modular lattices were studied by Grzeszczuk, Okiński and Puczyłowski.
For lattices of finite length there are many characterizations of semimodularity (see, for instance, Grätzer [3] and Stern [6]–[8]). The present paper deals with some conditions characterizing semimodularity in lower continuous strongly dually atomic lattices. We give here a generalization of results of paper [7].