Two characterizations of the shape of the base poset derived from the Lehmer code of a permutation using permutation patterns.

DOI10.4310/JOC.2014.V5.N4.A6MaRDI QIDQ2345761zbMATH OpenFDO

Authors Masaya Tomie

Publication date 20 May 2015

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

Full work available at URL https://arxiv.org/abs/1111.3094

zbMATH Keywords

inversions of permutationsjoin-irreducible elementsleft weak Bruhat orderLehmer codespattern avoidancepermutation patternsroot posets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Abstract: For a permutation $omegain{S}_n$ Denoncourt constructed a poset $M_{omega}$ which is the set of join-irreducibles of the Lehmer codes of the permutations in $[e,omega]$ in the inversion order on $S_n$. In this paper we show that $M_{omega}$ is a $B_2$-free poset if and only if $omega$ is a 3412-3421-avoiding permutation.

Recommendations

• A consecutive Lehmer code for parabolic quotients of the symmetric group
• Inversion sequences avoiding pairs of patterns
• Pattern avoidance in poset permutations
• Lehmer code transforms and Mahonian statistics on permutations
• Pattern avoidance and the Bruhat order.

Cited in

(1)

• A consecutive Lehmer code for parabolic quotients of the symmetric group

This page was built for publication: Two characterizations of the shape of the base poset derived from the Lehmer code of a permutation using permutation patterns.

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