Say a function is commutative if it remains unchanged under any permutation of its arguments. E.g. P

obrozenecy6

obrozenecy6

Answered question

2022-01-06

Say a function is commutative if it remains unchanged under any permutation of its arguments. E.g. f(0,1)=f(1,0). (Alternatively we could describe these as functions over multi-sets, or say that they are reflective about any hyperplane xi=xj). Some examples are sum, product and average.
1) Is there a name for these functions? Google searches for commutative and reflective functions dont

Answer & Explanation

Edward Patten

Edward Patten

Beginner2022-01-07Added 38 answers

These are called symmetric functions (of two variables.) There is a large literature, that mostly concentrates on symmetric polynomials. Any symmetric polynomial in two variables x, y is a polynomial in the variables x+y and xy. There is an important analogue for symmetric polynomials in more variables.
soanooooo40

soanooooo40

Beginner2022-01-08Added 35 answers

Every symmetric polynomial can be expressed as a polynomial in the elementary symmetric polynomials, the proof of which you can find on most Abstract Algebra texts (e.g. Dummit and Foote)

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Commutative Algebra

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?