PARTIALLY ORDERED PATTERNS AND THEIR COMBINATORIAL INTERPRETATIONS
Alexander Burstein, Sergey Kitaev · 2010
Abstract. 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.