Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović

DOI10.1016/j.ejc.2023.103898arXiv2204.05259MaRDI QIDQ6201885

Jonathan S. Bloom, Dan Saracino

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

maximal chainsHecke insertionstack polyominoesK-theoretic jeu de taquin

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Polyominoes (05B50) Classical problems, Schubert calculus (14N15)

Cites Work

• Unnamed Item
• Unnamed Item
• \(K\)-Knuth equivalence for increasing tableaux
• \(K\)-theory of minuscule varieties
• Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
• Increasing and decreasing sequences in fillings of moon polyominoes
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• A spherical initial ideal for Pfaffians
• A jeu de taquin theory for increasing tableaux, with application to \(K\)-theoretic Schubert calculus
• Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
• Generalized triangulations and diagonal-free subsets of stack polyominoes
• Crossings and nestings of matchings and partitions
• Quelques remarques sur une Construction de Schensted.

This page was built for publication: Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović