Abstract
This paper is a continuation of the study of partially ordered generalized patterns (POGPs) considered in [6, 7, 8]. We provide two general approaches: one to obtain connections between restricted permutations and other combinatorial structures, and one to treat the avoidance problems for words in case of segmented patterns. The former approach is related to coding combinatorial objects in terms of restricted permutations. We provide several examples of relations of our objects to 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.
| Original language | English |
|---|---|
| Number of pages | 6 |
| Publication status | Published - Mar 2005 |
| Event | The Third International Conference on Permutation Patterns - University of Florida, Gainesville, Florida, United States Duration: 7 Mar 2005 → 11 Mar 2005 |
Conference
| Conference | The Third International Conference on Permutation Patterns |
|---|---|
| Country/Territory | United States |
| City | Gainesville, Florida |
| Period | 7/03/05 → 11/03/05 |
Keywords
- pattern avoidance
- segmented patterns
- permutations
- labeled general graphs
- binary vectors
- coding