2000 character limit reached
A relation between the shape of a permutation and the shape of the base poset derived from the Lehmer codes
Published 14 Nov 2011 in math.CO | (1111.3094v1)
Abstract: For a permutation Denoncourt constructed a poset which is the set of join-irreducibles of the Lehmer codes of the permutations in in the inversion order on . In this paper we show that is a -free poset if and only if is a 3412-3421-avoiding permutation.
Paper Prompts
Sign up for free to create and run prompts on this paper.