Dual filtered graphs
We define a $K$ -theoretic analogue of Fomin’s dual graded graphs, which we call dual filtered graphs. The key formula in the definition is $DU - UD = D + I$. Our major examples are $K$ -theoretic analogues of Young’s lattice, the binary tree, and the graph determined by the Poirier-Reutenauer Hop...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Discrete Mathematics & Theoretical Computer Science
2015-01-01
|
| Σειρά: | Discrete Mathematics & Theoretical Computer Science |
| Θέματα: | |
| Διαθέσιμο Online: | https://dmtcs.episciences.org/2515/pdf |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|