1215 search results - page 134 / 243 » Combinatorics |
122
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that i...
146
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
113
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
138
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
114
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
An astral configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane where every point has q straight lines passing through it and every line h...