Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The dominance order for permutations

The dominance order for permutations AbstractWe define an order relation over Sn considering the Robinson-Schensted bijection and the dominance order over Young tableaux. This order relation makes Sn(k k - 1...3 2 1) -the set of permutations of length n that avoid the pattern k k - 1...3 2 1, k ≤ n- a principal filter in Sn. We study in detail these order relations on Sn(321) and Sn(4321), finding order-isomorphisms between these sets and sets of lattice paths. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pure Mathematics and Applications de Gruyter

The dominance order for permutations

Pure Mathematics and Applications , Volume 25 (1): 18 – Sep 1, 2015

Loading next page...
 
/lp/de-gruyter/the-dominance-order-for-permutations-yDxEGCmp8i

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
© 2015
eISSN
1788-800X
DOI
10.1515/puma-2015-0004
Publisher site
See Article on Publisher Site

Abstract

AbstractWe define an order relation over Sn considering the Robinson-Schensted bijection and the dominance order over Young tableaux. This order relation makes Sn(k k - 1...3 2 1) -the set of permutations of length n that avoid the pattern k k - 1...3 2 1, k ≤ n- a principal filter in Sn. We study in detail these order relations on Sn(321) and Sn(4321), finding order-isomorphisms between these sets and sets of lattice paths.

Journal

Pure Mathematics and Applicationsde Gruyter

Published: Sep 1, 2015

References