Dual equivalence graphs and CAT(0) combinatorics
From MaRDI portal
Publication:2632735
Recommendations
- Dualizability and graph algebras
- On finite dual Cayley graphs
- scientific article; zbMATH DE number 878894
- Dualizability of graphs
- Duality of graph invariants
- scientific article; zbMATH DE number 866068
- Dual equivalence graphs. I: a new paradigm for Schur positivity
- CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS
- Graphs of some CAT(0) complexes
- Categorical constructions in graph theory
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- Dual equivalence graphs revisited and the explicit Schur expansion of a family of LLT polynomials
- Dual equivalence with applications, including a conjecture of Proctor
- Ends of Group Pairs and Non-Positively Curved Cube Complexes
- Geodesics in CAT(0) cubical complexes
- Geometry of the space of phylogenetic trees
- La correspondance de Robinson
- Longest Increasing and Decreasing Subsequences
- Moving robots efficiently using the combinatorics of CAT(0) cubical complexes
- On the Schur expansion of Hall-Littlewood and related polynomials via Yamanouchi words
- Permutations, matrices, and generalized Young tableaux
- The geometry and topology of reconfiguration
This page was built for publication: Dual equivalence graphs and CAT(0) combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632735)