K-Knuth equivalence for increasing tableaux
From MaRDI portal
Publication:259166
zbMATH Open1332.05148arXiv1409.6659MaRDI QIDQ259166FDOQ259166
Christian Gaetz, Colleen Robichaux, David Schwein, Hailee Peck, Rebecca Patrias, Ka Yu Tam, Michelle Mastrianni
Publication date: 11 March 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: 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].
Full work available at URL: https://arxiv.org/abs/1409.6659
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Generalization of Knuth's formula for the number of skew tableaux
- Knuth relations, tableaux and MV-cycles
- Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux
- A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
- Increasing tableaux, Narayana numbers and an instance of the cyclic sieving phenomenon
- A \(k\)-tableau characterization of \(k\)-Schur functions
- Semistandard \(k\)-tableaux: Covering relations
- Curious cyclic sieving on increasing tableaux
- Cantorian tableaux revisited
- Generalized Foulkes' conjecture and tableaux construction
Cites Work
- Introduction to algorithms.
- A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
- Stable Grothendieck polynomials and \(K\)-theoretic factor sequences
- The Direct Sum Map on Grassmannians and Jeu de Taquin for Increasing Tableaux
- \(K\)-theory of minuscule varieties
- Title not available (Why is that?)
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
- Combinatorics of \(K\)-theory via a \(K\)-theoretic Poirier-Reutenauer bialgebra
Cited In (14)
- Increasing tableaux, Narayana numbers and an instance of the cyclic sieving phenomenon
- Shifted Hecke insertion and the \(K\)-theory of \(\mathrm{OG}(n,2n+1)\)
- Genomic tableaux
- Crystal structures for canonical Grothendieck functions
- Bijecting hidden symmetries for skew staircase shapes
- Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
- Linear compactness and combinatorial bialgebras
- Jacobi-Trudi determinants over finite fields
- Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović
- Rowmotion orbits of trapezoid posets
- Crystal structures for symmetric Grothendieck polynomials
- Grothendieck-to-Lascoux expansions
- Promotion of increasing tableaux: frames and homomesies
- Title not available (Why is that?)
This page was built for publication: \(K\)-Knuth equivalence for increasing tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259166)
