Add to ORKGthis paper we introduce an inductive construction for a symmetric chain decompostion of the lattice of subspaces of a finite dimensional vector space over an arbitrary field. The construction is, in a certain sense, an extension of the well known construction for boolean lattices [5]. Notatio
AbstractLoeb et al. (J. Combin. Theory. Ser A. 65 (1994) 151–157) gave an explicit semisymmetric cha...
AbstractLet U be an n-dimensional vector space over an algebraically closed field of characteristic ...
It is shown that the Boolean center of complemented elements in a bounded in-tegral residuated latti...
AbstractConsider the poset, ordered by inclusion, of subspaces of a four-dimensional vector space ov...
The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explici...
AbstractWe show that the lattice of noncrossing (set) partitions is self-dual and that it admits a s...
AbstractWe review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decompositio...
AbstractLet Vn(q) denote the n-dimensional vector space over the finite field with q elements, and L...
AbstractLet Nn denote the quotient poset of the Boolean lattice, Bn, under the relation equivalence ...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
conjecture, normalized matching property Let 2 [n] denote the Boolean lattice of order n, that is, t...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, …, n} o...
AbstractA description of the lattice of hyperinvariant subspaces of a linear transformation on a fin...
A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decompo...
We review the Green/Kleitman/Leeb interpretation of de Bruijn\u2019s symmetric chain decomposition o...
AbstractLoeb et al. (J. Combin. Theory. Ser A. 65 (1994) 151–157) gave an explicit semisymmetric cha...
AbstractLet U be an n-dimensional vector space over an algebraically closed field of characteristic ...
It is shown that the Boolean center of complemented elements in a bounded in-tegral residuated latti...
AbstractConsider the poset, ordered by inclusion, of subspaces of a four-dimensional vector space ov...
The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explici...
AbstractWe show that the lattice of noncrossing (set) partitions is self-dual and that it admits a s...
AbstractWe review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decompositio...
AbstractLet Vn(q) denote the n-dimensional vector space over the finite field with q elements, and L...
AbstractLet Nn denote the quotient poset of the Boolean lattice, Bn, under the relation equivalence ...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
conjecture, normalized matching property Let 2 [n] denote the Boolean lattice of order n, that is, t...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, …, n} o...
AbstractA description of the lattice of hyperinvariant subspaces of a linear transformation on a fin...
A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decompo...
We review the Green/Kleitman/Leeb interpretation of de Bruijn\u2019s symmetric chain decomposition o...
AbstractLoeb et al. (J. Combin. Theory. Ser A. 65 (1994) 151–157) gave an explicit semisymmetric cha...
AbstractLet U be an n-dimensional vector space over an algebraically closed field of characteristic ...
It is shown that the Boolean center of complemented elements in a bounded in-tegral residuated latti...