Kitaev, Sergey and Niedermaier, Andrew and Remmel, Jeffrey and Riehl, Manda (2013) Generalized pattern matching conditions for Ck o Sn. ISRN Combinatorics, 2013.Full text not available in this repository. Request a copy from the Strathclyde author
We present several multi-variable generating functions for a new pattern matching condition on the wreath product Ck o Sn of the cyclic group Ck and the symmetric group Sn. Our new pattern matching condition requires that the underlying permutations match in the usual sense of pattern matching for Sn and that the corresponding sequence of signs match in the sense of words, rather than the exact equality of signs which has been previously studied. We produce the generating functions for the number of matches that occur in elements of Ck o Sn for any pattern of length 2 by applying appropriate homomorphisms from the ring of symmetric functions over an in¯nite number of variables to simple symmetric function identities. We also provide multi-variable generating functions for the distribution of nonoverlapping matches and for the number of elements of Ck o Sn which have exactly 2 matches which do not overlap for several patterns of length 2.
|Keywords:||pattern matching conditions, permutations, symmetric functions, 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:44|
|Last modified:||04 Apr 2017 00:05|