Live briefing
Everything about Bell polynomials
Polynomials in combinatorial mathematics
In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions. They are related to Stirling and Bell numbers. They also occur in many applications, such as in Faà di Bruno's formula and an explicit formula for Lagrange inversion. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bell polynomialsA 5-minute orientation
- Skim a recent paper: Probabilistic Degenerate Bell Polynomials Associated with Random VariablesInfluential work since 2022
- Pick up a classic book: Know the essentials of algebra IIThe most-reprinted book on the subject
- Read the landmark paper: Some Identities on Truncated Polynomials Associated with Degenerate Bell PolynomialsCited 44 times
- Go sideways: Divided differencesA closely related topic
- Go sideways: Generating function transformationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Some Identities on Truncated Polynomials Associated with Degenerate Bell Polynomials
Some identities of Bell polynomials
Bell polynomials and binomial type sequences
Some Identities of Degenerate Bell Polynomials
General identities on Bell polynomials
NONCOMMUTATIVE BELL POLYNOMIALS
Multidimensional bell polynomials of higher order
An extension of the bell polynomials
🆕 Influential since 2022
Probabilistic Degenerate Bell Polynomials Associated with Random Variables
A probabilistic generalization of the Bell polynomials
Spivey-Type Recurrence Relations for Degenerate Bell and Dowling Polynomials
Heterogeneous Stirling Numbers and Heterogeneous Bell Polynomials
Probabilistic degenerate central Bell polynomials
📚 Books worth reading
Know the essentials of algebra IIFrederick H. Bell · 1985- 📕The dynamical Mordell-Lang conjectureJason P. Bell · 2016
Combinatorial Stochastic ProcessesJim Pitman · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Divided differences In mathematics, divided differences is an algorithm, historically used for computing tables of logarithms and trigonometric functions.[citation needed]…
- Generating function transformation In mathematics a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating…
- Exponential formula In combinatorial mathematics, the exponential formula (called the polymer expansion in physics) states that the exponential generating function for structures…
- Eulerian number In combinatorics, the Eulerian number A ( n , k ) {\textstyle A(n,k)} is the number of permutations of the numbers 1 to n {\textstyle n} in which exactly…
- Generalized hypergeometric function In mathematics, a generalized hypergeometric series is a power series in which the ratio of successive coefficients indexed by n {\displaystyle n} is a…
- Q-Pochhammer symbol In the mathematical field of combinatorics, the q-Pochhammer symbol, also called the q-shifted factorial, is the product ( a ; q ) n = ∏ k = 0 n − 1 (…
- Multiple zeta function In mathematics, the multiple zeta functions are generalizations of the Riemann zeta function, defined by ζ ( s 1 , … , s k ) = ∑ n 1 > n 2 > ⋯ > n k >…
- Mittag-Leffler polynomials In mathematics, the Mittag-Leffler polynomials are the polynomials gn(x) or Mn(x) studied by Mittag-Leffler (1891). Mn(x) is a special case of the Meixner…