Minimal paths between maximal chains in finite rank semimodular lattices

DOI10.1023/A:1008615111070zbMath0903.06006MaRDI QIDQ1383820

David Samuel Herscovici

Publication date: 13 April 1998

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

maximal chainsreduced decompositionsJordan-Hölder permutationfinite rank semimodular latticeminimal paths between flags

Mathematics Subject Classification ID

Semimodular lattices, geometric lattices (06C10)

Related Items (2)

Semimodular lattices and semibuildings ⋮ Characterizing flag graphs and incuced subgraphs of Cartesian product graphs

Cites Work

• The gallery distance of flags
• The geometry of the chamber system of a semimodular lattice
• Finite lattices and Jordan-Hölder sets
• Semimodular lattices and semibuildings
• Supersolvable lattices
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal paths between maximal chains in finite rank semimodular lattices