Insertion algorithms for Gelfand \(S_n\)-graphs
From MaRDI portal
Publication:6644277
DOI10.1007/S00026-024-00701-6MaRDI QIDQ6644277
Publication date: 27 November 2024
Published in: Annals of Combinatorics (Search for Journal in Brave)
Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- The Hodge theory of Soergel bimodules.
- Combinatorial Gelfand models.
- Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux
- Representations of Coxeter groups and Hecke algebras
- Dual equivalence with applications, including a conjecture of Proctor
- Balanced tableaux
- Permutation sign under the Robinson-Schensted correspondence
- Deformations of permutation representations of Coxeter groups.
- Quasiparabolic sets and Stanley symmetric functions for affine fixed-point-free involutions
- Gelfand \(W\)-graphs for classical Weyl groups
- Type \(A\) admissible cells are Kazhdan-Lusztig
- Perfect models for finite Coxeter groups
- DUAL EQUIVALENCE GRAPHS I: A NEW PARADIGM FOR SCHUR POSITIVITY
- Combinatorics of Coxeter Groups
- Longest Increasing and Decreasing Subsequences
- Admissible 𝑊-graphs
- Gröbner geometry for skew-symmetric matrix Schubert varieties
- Bar operators for quasiparabolic conjugacy classes in a Coxeter group.
This page was built for publication: Insertion algorithms for Gelfand \(S_n\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644277)