Sciweavers

Share
COMBINATORICS
2002
60views more  COMBINATORICS 2002»
9 years 9 months ago
Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
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,...
Catalin Zara
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
9 years 9 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
9 years 9 months ago
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
Brett Stevens
COMBINATORICS
2002
89views more  COMBINATORICS 2002»
9 years 9 months ago
A Concise Proof of the Littlewood-Richardson Rule
We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.
John R. Stembridge
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
9 years 9 months ago
New Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
Aaron Robertson
books