summary:It is well-known that there exist infinite modular lattices possessing no non-trivial valuations. In this paper a class $\Cal K$ of modular lattices is defined and it is proved that each lattice belonging to $\Cal K$ has a nontrivial valuation. Next, a result of $G$. Birkhoff concerning valuations on modular lattices of finite length is generalized
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes a...
This thesis consists of two parts. The first part is about the semigroup of values SV and the Poinca...
AbstractWhen is a finite modular lattice cover preserving embeddable into a partition lattice? We gi...
summary:It is well-known that there exist infinite modular lattices possessing no non-trivial valuat...
Abstract Valuations on finite lattices have been known for a long time. In this paper, we present a...
summary:In this paper a combinatorial result concerning paire of projective intervals of a modular l...
AbstractFirst a new approach is given to the technique of simple valuations previously introduced by...
Let L be a lattice. A function f : L → R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)...
AbstractLet L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
AbstractFinite length 2-distributive modular lattices of finite representation type are characterize...
AbstractLet L be a lattice (that is, a Z-module of finite rank), and let L=P(L) denote the family of...
We show that a self-generated set of combinatorial games, S, may not be hereditarily closed but, str...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, str...
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes a...
This thesis consists of two parts. The first part is about the semigroup of values SV and the Poinca...
AbstractWhen is a finite modular lattice cover preserving embeddable into a partition lattice? We gi...
summary:It is well-known that there exist infinite modular lattices possessing no non-trivial valuat...
Abstract Valuations on finite lattices have been known for a long time. In this paper, we present a...
summary:In this paper a combinatorial result concerning paire of projective intervals of a modular l...
AbstractFirst a new approach is given to the technique of simple valuations previously introduced by...
Let L be a lattice. A function f : L → R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)...
AbstractLet L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
AbstractFinite length 2-distributive modular lattices of finite representation type are characterize...
AbstractLet L be a lattice (that is, a Z-module of finite rank), and let L=P(L) denote the family of...
We show that a self-generated set of combinatorial games, S, may not be hereditarily closed but, str...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, str...
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes a...
This thesis consists of two parts. The first part is about the semigroup of values SV and the Poinca...
AbstractWhen is a finite modular lattice cover preserving embeddable into a partition lattice? We gi...
DOI
Add to ORKG