Kitaev, Sergey and Remmel, Jeffrey and Riehl, Manda (2013) On a pattern avoidance condition for the wreath product of cyclic groups with symmetric groups. ISRN Combinatorics, 2013.Full text not available in this repository. (Request a copy from the Strathclyde author)
In this paper, we extend, to a non-consecutive case, the study of the pattern matching condition on the wreath product Ck o Sn of the cyclic group Ck and the symmetric group Sn initiated in . The main focus of our paper is (colored) patterns of length 2, although a number of enumerative results for longer patterns are also presented. A new non-trivial bijective interpretation for the Catalan numbers is found, which is the number of elements in C2 o Sn bi-avoiding simultaneously (1-2,0 0) and (1-2,0 1).
|Keywords:||generalised pattern avoidance, cyclic groups, Catalan numbers, bijection, Electronic computers. Computer science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||17 Oct 2014 10:52|
|Last modified:||22 Mar 2017 13:35|