(q,t)-analogues and GL_n(F_q)

Details (q,t)-analogues and GL_n(F_q) (q,t)-analogues and GL_n(F_q)

2008-04-18

arxiv.org/abs/0804.3074v2

Mathematics

Combinatorics

Final version to appear in J. Algebraic Combin

Scientific paper

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q,t)-binomial coefficients and their interpretations generalize further in two directions, one relating to column-strict tableaux and Macdonald's ``seventh variation'' of Schur functions, the other relating to permutation statistics and Hilbert series from the invariant theory of GL_n(F_q).

Affiliated with

Also associated with

No associations

Rating

(q,t)-analogues and GL_n(F_q) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with (q,t)-analogues and GL_n(F_q), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (q,t)-analogues and GL_n(F_q) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304573