Papers
Topics
Authors
Recent
Search
2000 character limit reached

FFLV-type monomial bases for type $B$

Published 25 Oct 2016 in math.RT and math.CO | (1610.07984v4)

Abstract: We present a combinatorial monomial basis (or, more precisely, a family of monomial bases) in every finite-dimensional irreducible $\mathfrak{so}_{2n+1}$-module. These bases are in many ways similar to the FFLV bases for types $A$ and $C$. They are also defined combinatorially via sums over Dyck paths in certain triangular grids. Our sums, however, involve weights depending on the length of the corresponding root. Accordingly, our bases also induce bases in certain degenerations of the modules but these degenerations are obtained not from the filtration by PBW degree but by a weighted version thereof.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.