AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to be rank unimodal and strongly Sperner is presented. The distributive lattices which satisfy this condition are classified. These lattices are indexed by Dynkin diagrams of type ADE, which actually appear embedded in the Hasse diagrams of the lattices
Abstract. Let (W,S) be an arbitrary Coxeter system. For each sequence ω = (ω1, ω2,...) ∈ S ∗ in the...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractLet Λ be the cross section lattice of an irreducible representation of a semisimple algebrai...
AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to ...
AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams...
A full heap is an infinite partially ordered set with labeling taken from the nodes of an underlying...
AbstractWe introduce two families of symplectic analogs of the distributive lattices L(m, n). We giv...
Ringel CM, Roggenkamp KW. Indecomposable representations of orders and Dynkin diagramm. Comptes rend...
Abstract. The semi-affine Coxeter-Dynkin graph is introduced, generalizing both the affine and the f...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
Power-ordered sets are not always lattices. In the case of distributive lattices we give a descripti...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
AbstractThe rank of a partial ordering P is the maximum size of an irredundant family of linear exte...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
Abstract. Let (W,S) be an arbitrary Coxeter system. For each sequence ω = (ω1, ω2,...) ∈ S ∗ in the...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractLet Λ be the cross section lattice of an irreducible representation of a semisimple algebrai...
AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to ...
AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams...
A full heap is an infinite partially ordered set with labeling taken from the nodes of an underlying...
AbstractWe introduce two families of symplectic analogs of the distributive lattices L(m, n). We giv...
Ringel CM, Roggenkamp KW. Indecomposable representations of orders and Dynkin diagramm. Comptes rend...
Abstract. The semi-affine Coxeter-Dynkin graph is introduced, generalizing both the affine and the f...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
Power-ordered sets are not always lattices. In the case of distributive lattices we give a descripti...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
AbstractThe rank of a partial ordering P is the maximum size of an irredundant family of linear exte...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
International audienceIn this paper, we study structures such as distributive lattices, distributive...
Abstract. Let (W,S) be an arbitrary Coxeter system. For each sequence ω = (ω1, ω2,...) ∈ S ∗ in the...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractLet Λ be the cross section lattice of an irreducible representation of a semisimple algebrai...
DOI
Add to ORKG