A consecutive Lehmer code for parabolic quotients of the symmetric group

From MaRDI portal
Publication:820843



Abstract: In this article we define an encoding for parabolic permutations that distinguishes between parabolic 231-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a direct and simple proof that the parabolic Tamari lattice is isomorphic to a certain u-Tamari lattice, with an explicit bijection. Furthermore, we prove that this bijection is closely related to the map Theta used when the lattice isomorphism was first proved in (Ceballos, Fang and M"uhle, 2020), settling an open problem therein.


The authors define an encoding for parabolic permutations that distinguishes between parabolic \(231\)-avoiding permutations. They prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and construct a bijection inducing an isomorphism between the parabolic Tamari lattice and a certain \(\nu\)-Tamari lattice. Furthermore, they show how this bijection is closely related to the map used when the lattice isomorphism was first proved by \textit{C. Ceballos} et al. [Electron. J. Comb. 27, No. 1, Research Paper P1.14, 31 p. (2020; Zbl 1480.06003)].











This page was built for publication: A consecutive Lehmer code for parabolic quotients of the symmetric group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820843)