Burstein, Alexander and Kitaev, Sergey (2008) Partially ordered patterns and their combinatorial interpretations. Pure Mathematics and Applications, 19 (2-3). pp. 27-38. ISSN 1218-4586Full text not available in this repository. (Request a copy from the Strathclyde author)
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.
|Keywords:||pattern avoidance, segmented patterns, permutations, labeled general graphs, binary vectors, coding, Mathematics|
|Subjects:||Science > Mathematics|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||17 Oct 2014 15:00|
|Last modified:||31 Mar 2017 00:07|