Generalized pattern matching conditions for Ck ≀  Sn

Kitaev, Sergey and Niedermaier, Andrew and Remmel, Jeffrey and Riehl, Manda (2013) Generalized pattern matching conditions for Ck ≀  Sn. ISRN Combinatorics, 2013. 634823.

[img]
Preview
 Text (Kitaev-etal-ISRN-C-2013-Generalized-pattern-matching-conditions)
Kitaev_etal_ISRN_C_2013_Generalized_pattern_matching_conditions.pdf
Final Published Version
License: Creative Commons Attribution 3.0 logo
Download (2MB)| Preview

    Abstract

    We derive several multivariable generating functions for a generalized pattern-matching condition on the wreath product Ck ≀  Sn of the cyclic group Ck and the symmetric group Sn In particular, we derive the generating functions for the number of matches that occur in elements of Ck ≀  Sn for any pattern of length 2 by applying appropriate homomorphisms from the ring of symmetric functions over an infinite number of variables to simple symmetric function identities. This allows us to derive several natural analogues of the distribution of rises relative to the product order on elements of Ck ≀  Sn. Our research leads to connections to many known objects/structures yet to be explained combinatorially.

    Creators(s): Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647, Niedermaier, Andrew, Remmel, Jeffrey and Riehl, Manda;
    Item type:Article
    ID code:49883
    Keywords:pattern matching conditions, permutations, symmetric functions, wreath products, cyclic groups, 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:15 Feb 2020 02:43
    URI:https://strathprints.strath.ac.uk/id/eprint/49883
    Export data:
    CORE (COnnecting REpositories)