Introduction Graphs of groups, tree actions and edge-indexed graphs $Aut(X)$ and its discrete subgroups Existence of tree lattices Non-uniform coverings of indexed graphs with an arithmetic bridge Non-uniform coverings of indexed graphs with a separating edge Non-uniform coverin…
This work presents foundational research on two approaches to studying subgroup lattices of finite abelian [italic]p-groups. The first approach is linear algebraic in nature and generalizes Knuth's study of subspace lattices. This approach yields a combinatorial interpretation o…
This work presents foundational research on two approaches to studying subgroup lattices of finite abelian [italic]p-groups. The first approach is linear algebraic in nature and generalizes Knuth's study of subspace lattices. This approach yields a combinatorial interpretation o…
by Skala, Helen
fromMemoirs of the American Mathematical Society
The material presented is a generalization of the concepts of partial order and lattice. By starting out with a reflexive and antisymmetric, but not necessarily transitive, order, we define least upper bound and greatest lower bound similarly as for partially ordered sets, thus …
by Rose, Henry
fromMemoirs of the American Mathematical Society
by Rose, Henry
fromMemoirs of the American Mathematical Society
by Rose, Henry
fromMemoirs of the American Mathematical Society
by Rose, Henry
fromMemoirs of the American Mathematical Society
It is shown that there are eight infinite sequences of join irreducible lattice varieties with the following properties: each term of every sequence has the next term as its unique join irreducible cover. The description of these sequences is based on a detailed study of subdire…
by Rose, Henry
fromMemoirs of the American Mathematical Society
