A vector-indexed generalization of the unsigned Stirling numbers of the first kind, defined through a k-dimensional color-board problem, comes with a recurrence, an explicit upper bound, and a concentration estimate.
Lemma 3.2 is a special case of 饾憘饾應(饾憶, 饾憵)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
C sequential optimization numbers
A vector-indexed generalization of the unsigned Stirling numbers of the first kind, defined through a k-dimensional color-board problem, comes with a recurrence, an explicit upper bound, and a concentration estimate.