COMBINATORICS
2002
13 years 4 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
2002
13 years 4 months ago
2002
COMBINATORICS
2002
13 years 4 months ago
2002
: 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...
COMBINATORICS
2002
13 years 4 months ago
2002
COMBINATORICS
2002
13 years 4 months ago
2002
COMBINATORICS
2002
13 years 4 months ago
2002
COMBINATORICS
2002
13 years 4 months ago
2002
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...
COMBINATORICS
2002
13 years 4 months ago
2002
We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.
COMBINATORICS
2002
13 years 4 months ago
2002
Based on Sch
COMBINATORICS
2002
13 years 4 months ago
2002
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.