Generalized Pattern-Matching Conditions for | Zendy

Sergey Kitaev | Zendy; Andrew Niedermaier | Zendy; Jeffrey B. Remmel | Zendy; Manda Riehl | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Generalized Pattern-Matching Conditions for

Author(s) -

Sergey Kitaev,

Andrew Niedermaier,

Jeffrey B. Remmel,

Manda Riehl

Publication year - 2013

Publication title -

isrn combinatorics

Language(s) - English

Resource type - Journals

ISSN - 2090-8911

DOI - 10.1155/2013/634823

Subject(s) - mathematics , homomorphism , symmetric group , wreath product , product (mathematics) , multivariable calculus , simple (philosophy) , matching (statistics) , order (exchange) , symmetric function , combinatorics , group (periodic table) , function (biology) , generating function , ring (chemistry) , pure mathematics , geometry , statistics , economics , biology , philosophy , chemistry , organic chemistry , epistemology , finance , control engineering , evolutionary biology , engineering

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research