Results 251 to 260 of about 260,613 (297)
Some of the next articles are maybe not open access.

Engel lattice-ordered groups

Algebra and Logic, 1995
The author proves that any Engel lattice-ordered group (\(l\)-group) which generates a proper normal-valued variety of \(l\)-groups is \(o\)-approximable and that the Engel \(l\)-groups from any proper normal-valued variety of \(l\)-groups form a torsion class.
openaire   +2 more sources

Free lattice-ordered groups

Algebra and Logic, 1979
Let \(F_ r\) be the free lattice ordered group of finite rank \(r\geq 2\). A representation is obtained for \(F_ r\) as an \(\ell\)-subgroup of the \(\ell\)-group of all o-permutations of the real line. Using this representation the author proves the following.
openaire   +2 more sources

Disjointifiable lattice-ordered groups

Algebra universalis, 2008
This article studies disjointifiable lattice-ordered groups (abbr. dl-groups): the lattice-ordered groups G for which the frame \({\mathcal{C}}(G)\) of all convex l-subgroups is a normal frame; that is, for which \(A {\vee} B = G {\rm in} \mathcal{C}(G)\) implies the existence of \(C, D {\in} \,{\mathcal{C}}(G)\) such that C ⋂D = 0 and A ∨ D = C ∨ B ...
openaire   +1 more source

Nilpotent lattice-ordered groups

Mathematical Notes of the Academy of Sciences of the USSR, 1989
See the review in Zbl 0681.06006.
openaire   +1 more source

Frolík decompositions for lattice-ordered groups

Quaestiones Mathematicae, 2017
Frolik's theorem says that a homeomorphism from a certain kind of topological space to itself decomposes the space into the clopen set of xed points together with three clopen sets, each of whose images is disjoint from the original set. Stone's theorem translates this result to a corresponding theorem about the Riesz space of continuous functions on ...
Buskes, Gerard, Redfield, R.H.
openaire   +2 more sources

Countable lattice-ordered groups

Mathematical Proceedings of the Cambridge Philosophical Society, 1983
A lattice-ordered group is a group and a lattice such that the group operation distributes through the lattice operations (i.e. f(g ∨ h)k = fgk ∨ fhk and dually). Lattice-ordered groups are torsion-free groups and distributive lattices. They further satisfy f ∧ g = (f−1 ∨ g−1)−1 and f ∨ g = (f−1 ∧ g−1)−1. Since the lattice is distributive, each lattice-
openaire   +1 more source

Nilpotent lattice-ordered groups

Algebra Universalis, 1979
A lattice-ordered groupG isweakly abelian if for each ...
openaire   +1 more source

Lattice-Ordered Permutation Groups

1989
Although most of the elementary theorems about o-groups are as easy to prove in the general case as in the commutative case, there are no natural examples of non-commutative o-groups. Of course, it is easy to construct examples of non-commutative o-groups, but all of these are artificial and without much interest outside of the context of ordered ...
openaire   +1 more source

Home - About - Disclaimer - Privacy