ArticleslgStudy

mathematics

Stanley symmetric function

Stanley symmetric function is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Stanley symmetric function rather than just read about it. In short: In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by Richard Stanley (1984) in his study of the symmetric group of permutations. Formally, the Stanley symmetric function Fw(x1, x2, ...) indexed by a permutation w is defined as a sum of certain fundamental quasisymmetric functions.

Key takeaways

  • Stanley symmetric function belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Stanley symmetric function to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Stanley symmetric function from memory before moving on to harder problems.

Reference excerpt

In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by Richard Stanley (1984) in his study of the symmetric group of permutations. Formally, the Stanley symmetric function Fw(x1, x2, ...) indexed by a permutation w is defined as a sum of certain fundamental quasisymmetric functions. Each summand corresponds to a reduced decomposition of w, that is, to a way of writing w as a product of a minimal possible number of adjacent transpositions. They were introduced in the course of Stanley's enumeration of the reduced decompositions of permutations, and in particular his proof that the permutation w0 = n(n − 1)...21 (written here in one-line notation) has exactly

( n 2 ) ! 1 n − 1 ⋅ 3 n − 2 ⋅ 5 n − 3 ⋯ ( 2 n − 3 ) 1 {\displaystyle {\frac {{\binom {n}{2}}!}{1^{n-1}\cdot 3^{n-2}\cdot 5^{n-3}\cdots (2n-3)^{1}}}}

reduced decompositions. (Here ( n 2 ) {\displaystyle {\binom {n}{2}}} denotes the binomial coefficient n(n − 1)/2 and ! denotes the factorial.)

Properties The Stanley symmetric function Fw is homogeneous with degree equal to the number of inversions of w. Unlike other nice families of symmetric functions, the Stanley symmetric functions have many linear dependencies and so do not form a basis of the ring of symmetric functions. When a Stanley symmetric function is expanded in the basis of Schur functions, the coefficients are all non-negative integers. The Stanley symmetric functions have the property that they are the stable limit of Schubert polynomials

F w ( x ) = lim n → ∞ S 1 n × w ( x ) {\displaystyle F_{w}(x)=\lim _{n\to \infty }{\mathfrak {S}}_{1^{n}\times w}(x)}

where we treat both sides as formal power series, and take the limit coefficientwise.

References Stanley, Richard P. (1984), "On the number of reduced decompositions of elements of Coxeter groups" (PDF), European Journal of Combinatorics, 5 (4): 359–372, doi:10.1016/s0195-6698(84)80039-6, ISSN 0195-6698, MR 0782057

Worked examples

Example 1 — a first encounter with Stanley symmetric function

Start with the simplest possible case. Write down what Stanley symmetric function claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Stanley symmetric function before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Stanley symmetric function ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Stanley symmetric function

In research
Stanley symmetric function appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Stanley symmetric function in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Stanley symmetric function is common in secondary-school and first-year university syllabi. It links to neighbouring topics Polynomials, Symmetric functions, so understanding it makes those chapters shorter.
In everyday life
Look for Stanley symmetric function outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Stanley symmetric function in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Stanley symmetric function means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Stanley symmetric function out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Stanley symmetric function in simple terms?

In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by Richard Stanley (1984) in his study of the symmetric group of permutations. Formally, the Stanley symmetric function Fw(x1, x2, ...) indexed by a permutation w…

Why does Stanley symmetric function matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Stanley symmetric function?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Stanley symmetric function.

Tags

  • Polynomials
  • Symmetric functions

Keep exploring