Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

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.

[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.