Sciweavers

COMBINATORICS
2002
69views more  COMBINATORICS 2002»
13 years 10 months ago
Spanning Trees and Function Classes
If G = Kn is the complete graph, the classical Pr
Jeffrey B. Remmel, S. G. Williamson
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
13 years 11 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour