Geodesic
Minimal paths between maximal chains in finite rank semimodular lattices
Journal of Algebraic Combinatorics, Tome 7 (1998) no. 1, pp. 17-37.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: We study paths between maximal chains, or $ldquo$flags, $rdquo$ in finite rank semimodular lattices. Two flags are adjacent if they differ on at most one rank. A path is a sequence of flags in which consecutive flags are adjacent. We study the union of all flags on at least one minimum length path connecting two flags in the lattice. This is a subposet of the original lattice. If the lattice is modular, the subposet is equal to the sublattice generated by the flags. It is a distributive lattice which is determined by the $ldquo$Jordan-Hölder permutation $rdquo$ between the flags. The minimal paths correspond to all reduced decompositions of this permutation. In a semimodular lattice, the subposet is not uniquely determined by the Jordan-Hölder permutation for the flags. However, it is a join sublattice of the distributive lattice corresponding to this permutation. It is semimodular, unlike the lattice generated by the two flags, which may not be ranked. The minimal paths correspond to some reduced decompositions of the permutation, though not necessarily all. We classify the possible lattices which can arise in this way, and characterize all possibilities for the set of shortest paths between two flags in a semimodular lattice.
Keywords: semimodular lattice, maximal chain, Jordan-Hölder permutation, reduced decomposition 
@article{JAC_1998__7_1_a4,
     author = {Herscovici, David Samuel},
     title = {Minimal paths between maximal chains in finite rank semimodular lattices},
     journal = {Journal of Algebraic Combinatorics},
     pages = {17--37},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {1998},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_1998__7_1_a4/}
}
TY  - JOUR
AU  - Herscovici, David Samuel
TI  - Minimal paths between maximal chains in finite rank semimodular lattices
JO  - Journal of Algebraic Combinatorics
PY  - 1998
SP  - 17
EP  - 37
VL  - 7
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_1998__7_1_a4/
LA  - en
ID  - JAC_1998__7_1_a4
ER  - 
%0 Journal Article
%A Herscovici, David Samuel
%T Minimal paths between maximal chains in finite rank semimodular lattices
%J Journal of Algebraic Combinatorics
%D 1998
%P 17-37
%V 7
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_1998__7_1_a4/
%G en
%F JAC_1998__7_1_a4
Herscovici, David Samuel. Minimal paths between maximal chains in finite rank semimodular lattices. Journal of Algebraic Combinatorics, Tome 7 (1998) no. 1, pp. 17-37. http://geodesic.mathdoc.fr/item/JAC_1998__7_1_a4/