Complementary Algorithms for Tableaux Academic Article

abstract

• We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fourth operation, hopscotch, is new, although specialised versions have appeared previously. Like the other three operations, this new operation may be computed with a set of local rules in a growth diagram, and it preserves the Knuth equivalence class. Each of these four operations gives rise to an a priori distinct theory of dual equivalence. We show that these four theories coincide. The four operations are linked via the involutive tableau operations of complementation and conjugation. 2001 Academic Press.

authors

• Sottile, Frank

published proceedings

• Journal of Combinatorial Theory Series A

author list (cited authors)

• Roby, T., Sottile, F., Stroomer, J., & West, J.

citation count

• 2

complete list of authors

• Roby, Tom||Sottile, Frank||Stroomer, Jeff||West, Julian

publication date

• January 2001

publisher

• Elsevier  Publisher

published in

• Journal of Combinatorial Theory Series A  Journal

Digital Object Identifier (DOI)

• 10.1006/jcta.2001.3173

start page

• 127

end page

• 161

volume

• 96

issue

• 1

URL

• http://dx.doi.org/10.1006/jcta.2001.3173