Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Dual filtered graphs"”.

  1. Dual Filtered Graphs for Kac-Moody algebras

    We construct a strong filtered graph $\Gamma_s(\Lambda)$ dependent on the dominant weight $\Lambda$, and a weak filtered graph $\Gamma_w(\Kcen)$ dependent on the canonical central element $\Kcen$ for an arbitrary Kac-Moody algebra $g$. In our construction, both graphs $(\Gamma_s(\Lambda), …

    vt Repository record for Dual Filtered Graphs for Kac-Moody algebras (opens in a new tab)

  2. Combinatorial constructions motivated by K-theory of Grassmannians

    … we define a K-theoretic analogue of Fomin's dual graded graphs, which we call dual filtered graphs. They key formula in this definition is DU-UD=D+I. Our major examples are K-theoretic analogues of Young's lattice, of shifted Young's lattice, and of the Young-Fibonacci lattice. We suggest …

    umn Repository record for Combinatorial constructions motivated by K-theory of Grassmannians (opens in a new tab)