2022
DOI: 10.1016/j.jfa.2021.109285
|View full text |Cite
|
Sign up to set email alerts
|

Stirling operators in spatial combinatorics

Abstract: We define and study a spatial (infinite-dimensional) counterpart of Stirling numbers. In classical combinatorics, the Pochhammer symbol (m) n can be extended from a natural number m ∈ N to the falling factorials (z) n = z(z−1) • • • (z−n+1) of an argument z from F = R or C, and Stirling numbers of the first and second kinds are the coefficients of the expansions of (z) n through z k , k ≤ n and vice versa. When taking into account spatial positions of elements in a locally compact Polish space X, we replace N … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…These relations are similar to relations between moments and factorial moments of integer-valued random variables with Stirling numbers, see [14,Chapter 5]. A systematic treatment in terms of Stirling operators is found in [22].…”
Section: Appendix a Properties Of Generalized Orthogonal Polynomialsmentioning
confidence: 59%
See 1 more Smart Citation
“…These relations are similar to relations between moments and factorial moments of integer-valued random variables with Stirling numbers, see [14,Chapter 5]. A systematic treatment in terms of Stirling operators is found in [22].…”
Section: Appendix a Properties Of Generalized Orthogonal Polynomialsmentioning
confidence: 59%
“…Equation (3.4) will be used in Section 4 below to recover known self-duality functions for particle systems on finite set from the abstract Theorem 3.5. We refer to [22] for further properties of the generalized falling factorial polynomials. Our first main result is an intertwining relation between the Markov semigroup (P t ) t≥0 and (p…”
Section: Generalized Falling Factorial Polynomialsmentioning
confidence: 99%
“…To be friendly to more wide audience, we restrict out explanations to descriptions of main constructions and formulation of some particular results. For detailed discussions and extended references we refer to the recent paper [2].…”
Section: Introductionmentioning
confidence: 99%