Dual equivalence graphs and CAT(0) combinatorics
From MaRDI portal
Publication:2632735
zbMath1411.05275MaRDI QIDQ2632735
Publication date: 15 May 2019
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2018//92-Chavez-Guo.html
Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)
Cites Work
- Unnamed Item
- On the Schur expansion of Hall-Littlewood and related polynomials via Yamanouchi words
- Geodesics in CAT(0) cubical complexes
- Dual equivalence with applications, including a conjecture of Proctor
- Geometry of the space of phylogenetic trees
- Dual equivalence graphs revisited and the explicit Schur expansion of a family of LLT polynomials
- The geometry and topology of reconfiguration
- Permutations, matrices, and generalized Young tableaux
- Moving Robots Efficiently Using the Combinatorics of CAT(0) Cubical Complexes
- Longest Increasing and Decreasing Subsequences
- La correspondance de Robinson
- Ends of Group Pairs and Non-Positively Curved Cube Complexes
This page was built for publication: Dual equivalence graphs and CAT(0) combinatorics