




















Lehmer's code defines a bijection between the symmetric group and the set of staircase compositions. In this paper, we characterize a poset structure on these compositions that is equivalent to the strong Bruhat order on the symmetric group. This construction is intrinsic and does not require any reference to the associated permutations.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。