Content deleted Content added
Added links; rewrote opening description to make more sense |
|||
Line 1:
{{About|general properties of symmetric functions|the ring of symmetric functions in algebraic combinatorics|ring of symmetric functions}}
{{technical|date=March 2013}}
In [[mathematics]], a '''symmetric function of ''n'' variables''' is one whose value
== Symmetrization ==
{{main|Symmetrization}}
Given any function ''f'' in ''n'' variables with values in an [[abelian group]], a symmetric function can be constructed by summing values of ''f'' over all permutations of the arguments. Similarly, an anti-symmetric function can be constructed by summing over [[even permutation]]s and subtracting the sum over [[odd permutation]]s. These operations are of course not invertible, and could well result in a function that is identically zero for nontrivial functions ''f''. The only general case where ''f'' can be recovered if both its symmetrization and anti-symmetrization are known is when ''n'' = 2 and the abelian group admits a division by 2 (inverse of doubling); then ''f'' is equal to half the sum of its symmetrization and its anti-symmetrization.
== Examples ==
Line 42:
* [[Quasisymmetric function]]
* [[Ring of symmetric functions]]
* [[Even and odd functions]]
==References==
|