134 search results - page 9 / 27 » Combinatorics of diagrams of permutations |
COMBINATORICS
2002
13 years 9 months ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
COMBINATORICS
1998
13 years 9 months ago
1998
It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classi...
CPM
2007
Springer
14 years 3 months ago
2007
Springer
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
COMBINATORICS
2007
13 years 9 months ago
2007
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...