Problems for combinatorial numbers satisfying a class of triangular arrays
Articles
Igoris Belovas
Vilnius University
Published 2023-11-20
https://doi.org/10.15388/LMR.2023.33577
PDF

Keywords

combinatorial numbers
limit theorems
asymptotic normality

How to Cite

Belovas, I. (2023) “Problems for combinatorial numbers satisfying a class of triangular arrays”, Lietuvos matematikos rinkinys, 64(B), pp. 16–22. doi:10.15388/LMR.2023.33577.

Abstract

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 numbers, Eulerian numbers, Lah numbers, and their generalizations. In this work, we derive the general analytic expression of the numbers satisfying a class of triangular arrays and propose problems (both teaching and unsolved ones) for undergraduates studying probability theory and analytical combinatorics subjects in the study programs of the fields of mathematics and computer science. Some of the unsolved challenges can also be used as the basis for a thesis.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Downloads

Download data is not yet available.