492 search results - page 43 / 99 » combinatorics 2006 |
COMBINATORICS
2002
13 years 5 months ago
2002
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program pr...
COMBINATORICS
2002
13 years 5 months ago
2002
Fix a rectangular Young diagram R, and consider all the products of Schur functions ssc , where and c run over all (unordered) pairs of partitions which are complementary with re...
COMBINATORICS
2002
13 years 5 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
COMBINATORICS
2002
13 years 5 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 5 months ago
1998
The determinant that is present in traditional formulations of multivariate Lagrange inversion causes difficulties when one attempts to obtain asymptotic information. We obtain an...