A refinement of weak order intervals into distributive lattices
Combinatorics
2013-08-20 v3
Abstract
In this paper we consider arbitrary intervals in the left weak order on the symmetric group . We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the rank-generating function of this distributive lattice matches that of the weak order interval. We construct a poset such that its lattice of order ideals is isomorphic to the lattice of Lehmer codes of permutations in the given interval. We show that there are at least permutations in that form a rank-symmetric interval in the weak order.
Cite
@article{arxiv.1102.2689,
title = {A refinement of weak order intervals into distributive lattices},
author = {Hugh Denoncourt},
journal= {arXiv preprint arXiv:1102.2689},
year = {2013}
}
Comments
18 pages, 2 figures. Revised in light of comments of the referees. To appear in Annals of Combinatorics