Vacillating Hecke tableaux and linked partitions

DOI10.1007/S00209-015-1501-0MaRDI QIDQ897490zbMATH OpenOpenAlexFDO

Authors William Y. C. Chen, Peter L. Guo, Sabrina X. M. Pang

Publication date 7 December 2015

Published in Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.3849

zbMATH Keywords

crossing numberlinked partitionHecke diagramHecke insertion algorithmnesting numberrook stripvacillating Hecke tableau

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Partitions of sets (05A18) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Combinatorial aspects of partitions of integers (05A17) Enumeration in graph theory (05C30)

Abstract: We introduce the structure of vacillating Hecke tableaux, and establish a one-to-one correspondence between vacillating Hecke tableaux and linked partitions by using the Hecke insertion algorithm developed by Buch, Kresch, Shimozono, Tamvakis and Yong. Linked partitions arise in free probability theory. Motivated by the Hecke insertion algorithm, we define a Hecke diagram as a Young diagram possibly with a marked corner. A vacillating Hecke tableau is defined as a sequence of Hecke diagrams subject to certain addition and deletion of rook strips. The notion of a rook strip was introduced by Buch in the study of the Littlewood-Richardson rule for stable Grothendieck polynomials. A rook strip is a skew Young diagram with at most one square in each row and column. We show that the crossing number and the nesting number of a linked partition can be determined by the maximal number of rows and the maximal number of columns of the diagrams in the corresponding vacillating Hecke tableau. The proof relies on a theorem due to Thomas and Yong concerning the lengths of the longest strictly increasing and the longest strictly decreasing subsequences in a word. This implies that the crossing number and the nesting number have a symmetric joint distribution over linked partitions, confirming a conjecture of de Mier. We also prove a conjecture of Kim which states that the crossing number and the nesting number have a symmetric joint distribution over the front representations of partitions.

Recommendations

• Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
• Linked partitions and permutation tableaux
• The parity of the number of permutation tableaux in a fixed shape
• Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
• Linked partitions and linked cycles

Cites work

• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
• Crossings and nestings of matchings and partitions
• Front representation of set partitions
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Linked partitions and linked cycles
• Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
• Maximal increasing sequences in fillings of almost-moon polyominoes
• Multilinear function series and transforms in free probability theory
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• Stable Grothendieck polynomials and \(K\)-theoretic factor sequences
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams

Cited in

(3)

• Combinatorial Identities for Vacillating Tableaux
• Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
• On the limiting vacillating tableaux for integer sequences

This page was built for publication: Vacillating Hecke tableaux and linked partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897490)