2 papers
math.CO2006
Maximal Degree in the Strong Bruhat Order of Bn
Tamar Seeman
Given a permutation P in Sn, let G(P) be the graph on n vertices {1,...,n}, where two vertices i<j are adjacent if i appears right of j in P and there are no integers k with i<k<j…
math.CO2001
Shuffle Invariance of the Super-RSK Algorithm
Amitai Regev, Tamar Seeman
As in the -RSK (Robinson-Schensted-Knuth) of [1], other super-RSK algorithms can be applied to sequences of variables from the set , where $t_1<…