The generalized Stirling number is $S(n,k;\alpha,\beta,r)$ where the special case $S(n,k;-1,1,0)$ is the Lah number, $$S(n,k;-1,1,0)=\frac{n!}{k!}{{n-1}\choose{k-1}}$$ I wonder if there is any well-known form for $S(n,k;-1,-b,0)$. Even if there is no name for it, is there a clean (factorial-based) representation for it similar to Lah number's?
2026-03-27 05:57:30.1774591050
Lah numbers and Stirling numbers relation
645 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in COMBINATIONS
- Selection of "e" from "e"
- Selection of at least one vowel and one consonant
- Probability of a candidate being selected for a job.
- Proving that no two teams in a tournament win same number of games
- Selecting balls from infinite sample with certain conditions
- Divide objects in groups so that total sum of sizes in a group are balanced across groups
- Value of n from combinatorial equation
- Number of binary sequences with no consecutive ones.
- Count probability of getting rectangle
- Sum of all numbers formed by digits 1,2,3,4 & 5.
Related Questions in STIRLING-NUMBERS
- About the corvergence of series involving Stirling numbers of first kind and number theoretic functions
- Algebraic derivation of the recurrence for Stirling numbers of the second kind
- A sum involving Stirling numbers of the second kind.
- Number of entries are not divisible by x in the n th row of triangle
- odd property of Eulerian numbers
- Statistics: Using Stirling's Approximation with $3 N$
- General form of the coefficients of the polynomial $p(z)=\binom{q+z}{n}+\binom{q-z}{n}$
- Combinatorial proof for a Stirling identity
- How can I find $f(a,b,c)=e^{-c^a/a}\sum\limits_{n=0}^{\infty}\left(\frac{c^a}{a}\right)^{n}\frac{(an)^{b}}{n!}$?
- Asymptotic formula for the integral sequence s(n)
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
As per here, this set of generalized Stirling numbers may be given, when $ n \ne 0$ by: $$ S(n,k;-1,-b,0) = \frac{1}{(-b)^k k!} \sum_{j = 0}^n (-1)^j \binom{k}{j} ((j-k)b)^\overline{n} $$ Where $ (\cdot)^\overline{n} $ denotes the rising factorial. Due to the binomial coefficient, when $ j > k $ , the summand is zero. Due to the rising factorial, while $ j \le k $ the summand is zero, thus making the entire sum zero.
When $ n = 0$ : $$ S(0,k;a, b, c) = \delta_{0,k} $$
Therefore, the item is very well known and is commonly used, either $ 1 $ while $ n = k = 0 $ or $ 0 $ otherwise.