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 | |
Results tagged with symmetric-functions
Search options not deleted
user 14157
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.
4
votes
3
answers
267
views
Constructing the sum of two pairs of symmetric polynomials
I have a question about generating a certain set of symmetric polynomials. I believe that what I'm looking for is known result, but I'm not 100% sure.
Suppose that I have two sets of indeterminates …
- 515