Problems for combinatorial numbers satisfying a class of triangular arrays
Numbers satisfying a class of triangular arrays, defined by a bivariate first-order linear difference equation with linear coefficients, include a wide range of combinatorial numbers: binomial coefficients, Morgan numbers, Stirling numbers of the first and the second types, non-central Stirling num...
Saved in:
Main Author: | Igoris Belovas |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2023-11-01
|
Series: | Lietuvos Matematikos Rinkinys |
Subjects: | |
Online Access: | https://www.journals.vu.lt/LMR/article/view/33577 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The local limit theorem for complex valued sequences: the parabolic case
by: Coulombel, Jean-François, et al.
Published: (2024-11-01) -
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
by: Bryce Fuller, et al.
Published: (2024-01-01) -
Robust Combinatorial Optimization with Locally Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2021-05-01) -
A closer look at some new identities
by: Geoffrey B. Campbell
Published: (1998-01-01) -
Visible point vector summations from hypercube and hyperpyramid lattices
by: Geoffrey B. Campbell
Published: (1998-01-01)