Pattern classes of permutations via bijections between linearly ordered sets
From MaRDI portal
Publication:2462323
DOI10.1016/j.ejc.2006.12.005zbMath1126.05005OpenAlexW2084312895MaRDI QIDQ2462323
Sophie Huczynska, Nikola Ruškuc
Publication date: 30 November 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10023/2140
Related Items (2)
Embedding dualities for set partitions and for relational structures ⋮ Geometric grid classes of permutations
Cites Work
- Unnamed Item
- Unnamed Item
- Partially well-ordered closed sets of permutations
- Permutation patterns and continued fractions
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Profile classes and partial well-order for permutations
- Homogeneous permutations
- Restricted permutations and the wreath product
- Pattern avoidance classes and subpermutations
- Permutation Involvement and Groups
- Restricted permutations
- Restricted permutations
This page was built for publication: Pattern classes of permutations via bijections between linearly ordered sets