Consecutive patterns in permutations
نویسندگان
چکیده
In this paper we study the distribution of the number of occurrences of a permutation σ as a subword among all permutations in Sn. We solve the problem in several cases depending on the shape of σ by obtaining the corresponding bivariate exponential generating functions as solutions of certain linear differential equations with polynomial coefficients. Our method is based on the representation of permutations as increasing binary trees and on symbolic methods. 2003 Elsevier Science (USA). All rights reserved.
منابع مشابه
Asymptotic Enumeration of Permutations Avoiding Generalized Patterns
Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be adjacent in an occurrence of the pattern in the permutation, and consecutive patterns are a particular case of them. We determine the asymptotic behavior of the n...
متن کاملA reciprocity approach to computing generating functions for permutations with no pattern matches
2011 Using the reciprocal to calculate generating functions for permutations with no consecutive pattern matches Permutation Patterns 2011 San Luis Obispo, CA 2011 Reciprocal method to enumerate permutations with no consecutive pattern matches FPSAC 2011 Reykjavik, Iceland 2010 Pattern matching in the cycle structure of permutations Permutation Patterns 2010 Dartmouth, NH 2010 Advancement to ca...
متن کاملThe q-exponential generating function for permutations by consecutive patterns and inversions
The inverse of Fedou’s insertion-shift bijection is used to deduce a general form for the q-exponential generating function for permutations by consecutive patterns (overlaps allowed) and inversion number from a result due to Jackson and Goulden for enumerating words by distinguished factors. Explicit q-exponential generating functions are then derived for permutations by the consecutive patter...
متن کاملGeneralized descent patterns in permutations and associated Hopf algebras
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncom-mutative symmetric functions and quasi-symmetric functions.
متن کاملPattern Matching in the Cycle Structures of Permutations
In this paper, we study pattern matching conditions in the cycle structures of permutations. We develop methods to find the joint distribution of the number of cycles and the number of cycle descents over the set of permutations in the symmetric group Sn which have no cycle occurrences or no consecutive cycle occurrences of a given pattern or set of patterns. Our methods also allow us to refine...
متن کاملConsecutive Patterns: From Permutations to Column-Convex Polyominoes and Back
We expose the ties between the consecutive pattern enumeration problems as sociated with permutations, compositions, column-convex polyominoes, and words. Our perspective allows powerful methods from the contexts of compositions, column convex polyominoes, and of words to be applied directly to the enumeration of per mutations by consecutive patterns. We deduce a host of new consecutive patt...
متن کامل