Sciweavers

134 search results - page 12 / 27
» Combinatorics of diagrams of permutations
Sort
View
COMBINATORICS
2007
49views more  COMBINATORICS 2007»
13 years 9 months ago
Wreath Products of Permutation Classes
A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X Y of two permutation classes X and Y is als...
Robert Brignall
COMBINATORICS
2004
86views more  COMBINATORICS 2004»
13 years 9 months ago
Multiple Pattern Avoidance with respect to Fixed Points and Excedances
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
Sergi Elizalde
COMBINATORICS
2004
81views more  COMBINATORICS 2004»
13 years 9 months ago
A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
Jason E. Fulman
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
13 years 9 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
Martin Klazar
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
13 years 9 months ago
Increasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
Eric M. Rains