Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Symmetric functions are symmetric polynomials, in finitely many, or countably infinitely many variables. They arise in the representation theory of symmetric groups and in the polynomial representation theory of general linear groups. Bases of the ring of symmetric functions are indexed by integer partitions. Schur functions, elementary symmetric functions, complete symmetric functions, and power sum symmetric functions are the most commonly used bases.
2
votes
Accepted
Applying a simple involution to Hall-Littlewood polynomials
The transition matrix from the Schur functions to the HL symmetric functions is $K(t)$, the matrix of Kostka polynomials. This means that the transition matrix from $P(x;t)$ to $P(x;-t)$ is $K(t)^{-1} …
1
vote
Counting a Modified Class of Standard Young Tableau
Assuming that I'm understanding your definition of an almost standard tableau, I have an observation. Note that if we take an almost standard tableau and rearrange the entries of column $\lambda_r+1$ …