Partially ordered generalized patterns and their combinatorial interpretation
Burstein, Alexander and Kitaev, Sergey (2005) Partially ordered generalized patterns and their combinatorial interpretation. In: The Third International Conference on Permutation Patterns, 2005-03-07 - 2005-03-11, University of Florida.
Full text not available in this repository.Request a copyAbstract
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.
ORCID iDs
Burstein, Alexander and Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647;-
-
Item type: Conference or Workshop Item(Other) ID code: 49991 Dates: DateEventMarch 2005PublishedSubjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 23 Oct 2014 13:27 Last modified: 11 Nov 2024 16:42 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/49991