A combinatorial approach to the generalized central factorial numbers

DOI10.1007/s00009-021-01830-5zbMath1486.11028OpenAlexW3195496662MaRDI QIDQ2050156

José L. Ramírez, Takao Komatsu, Diego Villamizar

Publication date: 30 August 2021

Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00009-021-01830-5

zbMATH Keywords

generating functionsStirling numbersBernoulli numbersset partitionscentral factorial numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Binomial coefficients; factorials; (q)-identities (11B65) Bernoulli and Euler numbers and polynomials (11B68)

Related Items (4)

New modular symmetric function and its applications: modular \(s\)-Stirling numbers ⋮ Some positivities in Stirling arrays with higher level ⋮ Convolution identities of poly-Cauchy numbers with level 2 ⋮ On \(s\)-Stirling transform and poly-Cauchy numbers of the second kind with level 2

Cites Work

• Unnamed Item
• Unnamed Item
• The \(r\)-Stirling numbers
• Interpretations combinatoires des nombres de Genocchi
• Connections between central factorial numbers and Bernoulli polynomials
• Central factorial numbers; their main properties and some applications.
• The Divided Central Differences of Zero
• Combinatorics of Set Partitions
• A Combinatorial Approach to the Stirling Numbers of the First Kind with Higher Level
• Combinatorics and Number Theory of Counting Sequences

This page was built for publication: A combinatorial approach to the generalized central factorial numbers