K-Knuth Equivalence for Increasing Tableaux
| Autor: | Ka Yu Tam, David Schwein, Hailee Peck, Michelle Mastrianni, Colleen Robichaux, Christian Gaetz, Rebecca Patrias |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: |
Discrete mathematics
Class (set theory) Applied Mathematics 010102 general mathematics Jeu de taquin 0102 computer and information sciences K-theory 01 natural sciences Theoretical Computer Science Combinatorics Computational Theory and Mathematics 010201 computation theory & mathematics FOS: Mathematics Discrete Mathematics and Combinatorics Equivalence relation Mathematics - Combinatorics Geometry and Topology Combinatorics (math.CO) 0101 mathematics Equivalence (measure theory) Mathematics |
| Zdroj: | Scopus-Elsevier |
| Popis: | A K-theoretic analogue of RSK insertion and Knuth equivalence relations was first introduced in 2006 by Buch, Kresch, Shimozono, Tamvakis, and Yong. The resulting K-Knuth equivalence relations on words and increasing tableaux on [n] has 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]. 35 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|