Results 1  10
of
62
Quicksort asymptotics
 Journal of Algorithms
, 2002
"... normality of statistics on permutation tableaux ..."
Multiavoidance of generalised patterns
 Discrete Math
, 2002
"... Abstract Recently, Babson and Steingr'imsson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3patterns without internal dashes, that is, where the ..."
Abstract

Cited by 32 (14 self)
 Add to MetaCart
Abstract Recently, Babson and Steingr'imsson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3patterns without internal dashes, that is, where the pattern corresponds to a contiguous subword in a permutation.
On some properties of permutation tableaux
, 2006
"... Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions of Steingrímsson and Williams [9], in particular, on the distribution of the bistatistic of numbers of rows and essential ones in permutation tableaux. We ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions of Steingrímsson and Williams [9], in particular, on the distribution of the bistatistic of numbers of rows and essential ones in permutation tableaux. We also consider and enumerate sets of permutation tableaux related to some pattern restrictions on permutations. 1.
Words restricted by 3letter generalized multipermutation patterns
 Annals of Combinatorics
"... Abstract. We find exact formulas and/or generating functions for the number of words avoiding 3letter generalized multipermutation patterns and find which of them are equally avoided. 1. ..."
Abstract

Cited by 23 (14 self)
 Add to MetaCart
Abstract. We find exact formulas and/or generating functions for the number of words avoiding 3letter generalized multipermutation patterns and find which of them are equally avoided. 1.
Consecutive patterns in permutations
 Adv. in Appl. Math
, 2003
"... Abstract. 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 cer ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
Abstract. 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. 1.
The insertion encoding of permutations
, 2005
"... We introduce the insertion encoding, an encoding of finite permutations. Classes of permutations whose insertion encodings form a regular language are characterized. Some necessary conditions are provided for a class of permutations to have insertion encodings that form a context free language. Appl ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
We introduce the insertion encoding, an encoding of finite permutations. Classes of permutations whose insertion encodings form a regular language are characterized. Some necessary conditions are provided for a class of permutations to have insertion encodings that form a context free language. Applications of the insertion encoding to the evaluation of generating functions for classes of permutations, construction of polynomial time algorithms for enumerating such classes, and the illustration of bijective equivalence between classes are demonstrated.
Enumerating permutations avoiding a pair of BabsonSteingrímsson patterns
 Ars Combinatorica
, 2005
"... Abstract. Babson and Steingrímsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of typ ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
Abstract. Babson and Steingrímsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1, 2) or (2, 1). For eight of these twelve patterns the answer is given by the Bell numbers. For the remaining four the answer is given by the Catalan numbers. In the present paper we give a complete solution for the number of permutations avoiding a pair of patterns of type (1, 2) or (2, 1). We also conjecture the number of permutations avoiding the patterns in any set of three or more such patterns. 1.
Asymptotic enumeration of permutations avoiding generalized patterns
 Advances in Applied Mathematics 36
, 2006
"... Abstract. Motivated by the recent proof of the StanleyWilf 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 permuta ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Abstract. Motivated by the recent proof of the StanleyWilf 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 number of permutations avoiding a consecutive pattern, showing that they are an exponentially small proportion of the total number of permutations. For some other generalized patterns we give partial results, showing that the number of permutations avoiding them grows faster than for classical patterns but more slowly than for consecutive patterns. 1.
RESTRICTED 132 PERMUTATIONS AND GENERALIZED PATTERNS
, 2001
"... Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number of permutations on n letters avoiding 132 (or containing 1 ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number of permutations on n letters avoiding 132 (or containing 132 exactly once) and an arbitrary generalized pattern τ on k letters, or containing τ exactly once. In several cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind, and generating function of Motzkin numbers. 1
BIJECTIONS FOR PERMUTATION TABLEAUX
"... In this paper we propose two bijections between permutation tableaux and permutations. These bijections show how natural statistics on the tableaux are equidistributed to classical statistics on permutations: descents, RLminima and pattern enumerations. We then use those bijections to define subcl ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
In this paper we propose two bijections between permutation tableaux and permutations. These bijections show how natural statistics on the tableaux are equidistributed to classical statistics on permutations: descents, RLminima and pattern enumerations. We then use those bijections to define subclasses of permutation tableaux that are in bijection with set partitions.