This paper is a continuation of the study of partially ordered patterns (POPs) introduced recently. We provide a general approach to code combinatorial objects using (POP-)restricted permutations. We give several examples of relations between permutations restricted by POPs and other combinatorial structures, such as labeled graphs, walks, binary vectors, and others. Also, we show how restricted permutations are related to Cartesian products of certain objects.
|Number of pages||12|
|Journal||Pure Mathematics and Applications|
|Publication status||Published - 2008|
- pattern avoidance
- segmented patterns
- labeled general graphs
- binary vectors