AbstractWe make a systematic study of a new concept in the theory of jeu-de-taquin, which we call dual equivalence. Using this, we prove a conjecture of Proctor establishing a bijection between standard tableaux of ‘shifted staircase’ shape and reduced expressions for the longest element in the Coxeter group Bl. We also get a new and more illuminating proof of the analogous theorem, due to Greene and Edelman, for the Coxeter group Al, and arrive at yet one more theorem of a similar type. We explain some symmetric functions associated to reduced expressions by Stanley and prove his conjecture that one of these for Bl is the Schur function sλ for λ an l-by-l square. We classify shifted and unshifted shapes for which the total promotion operat...
We prove a restriction of an analogue of the Robinson-Schensted-Knuth correspondence for semi-skylin...
Abstract. We define an analog of David Little’s algorithm for reduced words in type B, and investiga...
Schensted [C’anad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence be...
AbstractWe make a systematic study of a new concept in the theory of jeu-de-taquin, which we call du...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractIn this paper, we study the combinatorics related to complements of tableaux. Using the repr...
Thesis (Ph.D.)--University of Washington, 2014In 2007 Sami Assaf introduced dual equivalence graphs ...
AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of ...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
We construct a "Koszul duality" equivalence relating the (diagrammatic) Hecke category attached to a...
Stanley conjectured that the number of maximal chains in the weak Bruhat order of S n, or equivalent...
2018-08-07In this work we explore shifted combinatorics, making new constructions and proving result...
For any polynomial representation of the special linear group, the nodes of the corresponding crysta...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
We prove a restriction of an analogue of the Robinson-Schensted-Knuth correspondence for semi-skylin...
Abstract. We define an analog of David Little’s algorithm for reduced words in type B, and investiga...
Schensted [C’anad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence be...
AbstractWe make a systematic study of a new concept in the theory of jeu-de-taquin, which we call du...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractIn this paper, we study the combinatorics related to complements of tableaux. Using the repr...
Thesis (Ph.D.)--University of Washington, 2014In 2007 Sami Assaf introduced dual equivalence graphs ...
AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of ...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
We construct a "Koszul duality" equivalence relating the (diagrammatic) Hecke category attached to a...
Stanley conjectured that the number of maximal chains in the weak Bruhat order of S n, or equivalent...
2018-08-07In this work we explore shifted combinatorics, making new constructions and proving result...
For any polynomial representation of the special linear group, the nodes of the corresponding crysta...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
We prove a restriction of an analogue of the Robinson-Schensted-Knuth correspondence for semi-skylin...
Abstract. We define an analog of David Little’s algorithm for reduced words in type B, and investiga...
Schensted [C’anad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence be...