science

Stirling transform

Stirling transform is a science 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 Stirling transform rather than just read about it. In short: In combinatorial mathematics, the Stirling transform of a sequence { an : n = 1, 2, 3, ... } of numbers is the sequence { bn : n = 1, 2, 3, ... } given by b n = ∑ k = 1 n { n k } a k {\displaystyle b_{n}=\sum _{k=1}^{n}\left\{{\begin{matrix}n\\k\end{matrix}}\right\}a_{k}} , where { n k } {\displaystyle \left\{{\begin{matrix}n\\k\end{matrix}}\right\}} is the Stirling number of the second kind, which is the number of…

Key takeaways

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

Reference excerpt

In combinatorial mathematics, the Stirling transform of a sequence { an : n = 1, 2, 3, ... } of numbers is the sequence { bn : n = 1, 2, 3, ... } given by

b n = ∑ k = 1 n { n k } a k {\displaystyle b_{n}=\sum _{k=1}^{n}\left\{{\begin{matrix}n\\k\end{matrix}}\right\}a_{k}} , where { n k } {\displaystyle \left\{{\begin{matrix}n\\k\end{matrix}}\right\}} is the Stirling number of the second kind, which is the number of partitions of a set of size n {\displaystyle n} into k {\displaystyle k} parts. This is a linear sequence transformation. The inverse transform is

a n = ∑ k = 1 n ( − 1 ) n − k [ n k ] b k {\displaystyle a_{n}=\sum _{k=1}^{n}(-1)^{n-k}\left[{n \atop k}\right]b_{k}} , where ( − 1 ) n − k [ n k ] {\textstyle (-1)^{n-k}\left[{n \atop k}\right]} is a signed Stirling number of the first kind, where the unsigned [ n k ] {\displaystyle \left[{n \atop k}\right]} can be defined as the number of permutations on n {\displaystyle n} elements with k {\displaystyle k} cycles. Berstein and Sloane (cited below) state "If an is the number of objects in some class with points labeled 1, 2, ..., n (with all labels distinct, i.e. ordinary labeled structures), then bn is the number of objects with points labeled 1, 2, ..., n (with repetitions allowed)." If

f ( x ) = ∑ n = 1 ∞ a n n ! x n {\displaystyle f(x)=\sum _{n=1}^{\infty }{a_{n} \over n!}x^{n}}

is a formal power series, and

g ( x ) = ∑ n = 1 ∞ b n n ! x n {\displaystyle g(x)=\sum _{n=1}^{\infty }{b_{n} \over n!}x^{n}}

with an and bn as above, then

g ( x ) = f ( e x − 1 ) {\displaystyle g(x)=f(e^{x}-1)} . Likewise, the inverse transform leads to the generating function identity

f ( x ) = g ( log ⁡ ( 1 + x ) ) {\displaystyle f(x)=g(\log(1+x))} .

See also Binomial transform Generating function transformation List of factorial and binomial topics

References Bernstein, M.; Sloane, N. J. A. (1995). "Some canonical sequences of integers". Linear Algebra and Its Applications. 226/228: 57–72. arXiv:math/0205301. doi:10.1016/0024-3795(94)00245-9. S2CID 14672360.. Khristo N. Boyadzhiev, Notes on the Binomial Transform, Theory and Table, with Appendix on the Stirling Transform (2018), World Scientific.

Worked examples

Example 1 — a first encounter with Stirling transform

Start with the simplest possible case. Write down what Stirling transform claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, 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 Stirling transform 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 Stirling transform 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 Stirling transform

In research: Stirling transform appears in science 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 Stirling transform 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: Stirling transform is common in secondary-school and first-year university syllabi. It links to neighbouring topics Factorial and binomial topics, Transforms, so understanding it makes those chapters shorter.
In everyday life: Look for Stirling transform 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 Stirling transform in 20 minutes

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

Frequently asked questions

What is Stirling transform in simple terms?

In combinatorial mathematics, the Stirling transform of a sequence { an : n = 1, 2, 3, ... } of numbers is the sequence { bn : n = 1, 2, 3, ... } given by b n = ∑ k = 1 n { n k } a k {\displaystyle b_{n}=\sum _{k=1}^{n}\left\{{\begin{matrix}n\\k\end{matrix}}\right\}a_{k}} , where { n k } {\displays…

Why does Stirling transform matter?

Because it connects several science 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 Stirling transform?

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 Stirling transform.