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...

Full description

Saved in:
Bibliographic Details
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!
Description
Summary: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.
ISSN:0132-2818
2335-898X