K-Knuth equivalence for increasing tableaux

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A K-theoretic analogue of RSK insertion and the Knuth equivalence relations were introduced by Buch, Kresch, Shimozono, Tamvakis, and Yong (2006) and Buch and Samuel (2013), respectively. The resulting K-Knuth equivalence relations on words and increasing tableaux on [n] have prompted investigation into the equivalence classes of tableaux arising from these relations. Of particular interest are the tableaux that are unique in their class, which we refer to as unique rectification targets (URTs). In this paper we give several new families of URTs and a bound on the length of intermediate words connecting two K-Knuth equivalent words. In addition, we describe an algorithm to determine if two words are K-Knuth equivalent and to compute all K-Knuth equivalence classes of tableaux on [n].

Cite

CITATION STYLE

APA

Gaetz, C., Mastrianni, M., Patrias, R., Peck, H., Robichaux, C., Schwein, D., & Tam, K. Y. (2016). K-Knuth equivalence for increasing tableaux. Electronic Journal of Combinatorics, 23(1). https://doi.org/10.37236/4805

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free