Combinatorics Algebraic combinatorics Concept
Symmetric function
Summary
A symmetric function is a formal power series of bounded degree in infinitely many variables , see the definition. It does not change under any permutation of the variables. The symmetric functions form the ring , which collects the symmetric polynomials in all numbers of variables at once. The ring has several bases indexed by integer partitions: monomial, elementary, complete homogeneous and Schur functions. Over , the power sum symmetric functions give one more basis. It is a central object of algebraic combinatorics and of the representation theory of symmetric and general linear groups.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | PAJEHWXW6M |
|---|---|
| URI | m2://PAJEHWXW6M |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05E05 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.