15 citations · 72 across the 18 of their papers we have counts for
6 papers · 1 filter
On a pattern avoidance condition for the wreath product of cyclic groups with symmetric groups
Sergey Kitaev, Jeffrey Remmel, Manda Riehl
In this paper, we extend to a non-consecutive case, the study of the pattern matching condition on the wreath product of the cyclic group and the symmetric group initiated by the a…
A direct encoding of Stoimenow's matchings as ascent sequences
Anders Claesson, Mark Dukes, Sergey Kitaev
In connection with Vassiliev's knot invariants, Stoimenow (1998) introduced certain matchings, also called regular linearized chord diagrams. Bousquet-Melou et al. (2008) gave a bi…
New pattern matching conditions for wreath products of the cyclic groups with symmetric groups
Sergey Kitaev, Andrew Niedermaier, Jeffrey Remmel +1
We present several multi-variable generating functions for a new pattern matching condition on the wreath product of the cyclic group and the symmetric group. Our new pattern match…
Equidistribution of (X,Y)-descents, (X,Y)-adjacent pairs, and (X,Y)-place-value pairs on permutations
Emeric Deutsch, Sergey Kitaev, Jeffrey Remmel
An -descent in a permutation is a pair of adjacent elements such that the first element is from , the second element is from , and the first element is greater than th…
Place-difference-value patterns: A generalization of generalized permutation and word patterns
Sergey Kitaev, Jeffrey Remmel
Motivated by study of Mahonian statistics, in 2000, Babson and Steingrimsson introduced the notion of a "generalized permutation pattern" (GP) which generalizes the concept of "cla…
Avoiding substrings in compositons
Silvia Heubach, Sergey Kitaev
A classical result by Guibas and Odlyzko obtained in 1981 gives the generating function for the number of strings that avoid a given set of substrings with the property that no sub…