Reference request: representation of type G2 Lie algebras. Let $\mathfrak{g}$ be an Lie algebra of type G2. Are there some combinatorial ways to describe a basis of a $\mathfrak{g}$-module? For classical types, there is a method used tableaux. Thank you very much.
 A: Assuming you are working in the classical setting over a field like $\mathbb{C}$, I'm unaware of any elementary way to identify a natural basis in each irreducible finite dimensional module.    But using creative indirect methods via quantum groups, Lusztig was able to define such canonical bases for all Lie types (and Kashiwara arrived at related methods independently).  While the actual construction of such bases in individual cases like $G_2$ is not easy to implement, it is in principle "combinatorial" and is "canonical" in a strong sense.  Lusztig's 1990 paper is freely available online here.   See in particular 0.6 in the introduction.
P.S. As Steven points out, Littelmann's work (in many papers worth consulting) provides a new combinatorial framework for many of the standard problems in characteristic 0 about representations of semisimple Lie algebras; much of this generalizes to symmetrizable Kac-Moody algebras as well.   In particular, his path method provides an algorithmic way to work out bases and characters, though the best results are obtained in type A.      Other powerful methods are those of Lusztig (canonical basis) and Kashiwara (crystal basis), which are closely related to each other.  All of this work probably has more theoretical than practical interest.   Whatever approach is used, even in type $G_2$ the dimensions of irreducible representations (computed readily from Weyl's formula) grow so rapidly that it's questionable how far one can go in practice toward finding explicit bases of weight spaces or gaining extra insight from them.    
A: This paper constructs the representations of $G_2$ explicitly in terms of the Schur functor construction and multilinear operations: http://www.ams.org/journals/proc/1999-127-03/S0002-9939-99-04583-9/home.html
It doesn't give you a preferred basis in terms of tableaux though. For that, you might want to look at the book "Standard monomial theory" by Lakshmibai and Raghavan. But this is much less explicit. This paper of Littelmann does in much greater generality: http://www.ams.org/jams/1998-11-03/S0894-0347-98-00268-9/S0894-0347-98-00268-9.pdf
A: Another direction, that works (only?) for groups of rank at most 2, is Kuperberg's "spider" model: http://arxiv.org/abs/q-alg/9712003 .  The web diagrams he constructs generalize tableaux, in the sense that the $A_1$ and $A_2$ versions are in bijection with tableaux (at least of rectangular shape).  This is not quite the same as constructing representations via Schur functors, but it has a combinatorial appeal.
