A Combinatorial Approach to the Stirling Numbers of the First Kind with Higher Level

2021 ◽  
Vol 58 (3) ◽  
pp. 293-307
Author(s):  
Takao Komatsu ◽  
José L. Ramírez ◽  
Diego Villamizar
Keyword(s):  
Power Series ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Combinatorial Approach ◽  
Extra Condition ◽  
Minimal Elements ◽  
Combinatorial Properties ◽  
Cauchy Numbers ◽  
Central Factorial Numbers ◽  
Formal Power

In this paper, we investigate a generalization of the classical Stirling numbers of the first kind by considering permutations over tuples with an extra condition on the minimal elements of the cycles. The main focus of this work is the analysis of combinatorial properties of these new objects. We give general combinatorial identities and some recurrence relations. We also show some connections with other sequences such as poly-Cauchy numbers with higher level and central factorial numbers. To obtain our results, we use pure combinatorial arguments and classical manipulations of formal power series.

A generalized class of restricted Stirling and Lah numbers

2018 ◽  
Vol 68 (4) ◽  
pp. 727-740 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck
Keyword(s):  
Generating Function ◽  
Stirling Numbers ◽  
Combinatorial Properties ◽  
Exponential Generating Function ◽  
Cauchy Numbers ◽  
Restricted Stirling Numbers

Abstract In this paper, we consider a polynomial generalization, denoted by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k), of the restricted Stirling numbers of the first and second kind, which reduces to these numbers when a = 1 and b = 0 or when a = 0 and b = 1, respectively. If a = b = 1, then $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) gives the cardinality of the set of Lah distributions on n distinct objects in which no block has cardinality exceeding m with k blocks altogether. We derive several combinatorial properties satisfied by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) and some additional properties in the case when a = b = 1. Our results not only generalize previous formulas found for the restricted Stirling numbers of both kinds but also yield apparently new formulas for these numbers in several cases. Finally, an exponential generating function formula is derived for $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) as well as for the associated Cauchy numbers.

Generalized Stirling numbers with poly-Bernoulli and poly-Cauchy numbers

2018 ◽  
Vol 14 (05) ◽  
pp. 1211-1222 ◽  
Author(s):  
Takao Komatsu ◽  
Paul Thomas Young
Keyword(s):  
Stirling Numbers ◽  
Combinatorial Properties ◽  
Cauchy Numbers ◽  
Generalized Stirling Numbers

By using the generalized Stirling numbers studied by Hsu and Shiue, we define a new kind of generalized poly-Bernoulli and poly-Cauchy numbers. By using the formulae of the generalized Stirling numbers, we give their characteristic and combinatorial properties.

scholarly journals New families of special numbers for computing negative order Euler numbers and related numbers and polynomials

2018 ◽  
Vol 12 (1) ◽  
pp. 1-35 ◽  
Author(s):  
Yilmaz Simsek
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Bernstein Polynomials ◽  
Fibonacci Numbers ◽  
Stirling Numbers ◽  
Euler Numbers ◽  
Open Questions ◽  
Negative Order ◽  
Central Factorial Numbers ◽  
Probability And Statistics

The main purpose of this paper is to construct new families of special numbers with their generating functions. These numbers are related to many well-known numbers, which are Bernoulli numbers, Fibonacci numbers, Lucas numbers, Stirling numbers of the second kind and central factorial numbers. Our other inspiration of this paper is related to the Golombek's problem [15] "Aufgabe 1088. El. Math., 49 (1994), 126-127". Our first numbers are not only related to the Golombek's problem, but also computation of the negative order Euler numbers. We compute a few values of the numbers which are given by tables. We give some applications in probability and statistics. That is, special values of mathematical expectation of the binomial distribution and the Bernstein polynomials give us the value of our numbers. Taking derivative of our generating functions, we give partial differential equations and also functional equations. By using these equations, we derive recurrence relations and some formulas of our numbers. Moreover, we come up with a conjecture with two open questions related to our new numbers. We give two algorithms for computation of our numbers. We also give some combinatorial applications, further remarks on our new numbers and their generating functions.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

Identities related to special polynomials and combinatorial numbers

Filomat ◽  
2017 ◽  
Vol 31 (15) ◽  
pp. 4833-4844 ◽  
Author(s):  
Eda Yuluklu ◽  
Yilmaz Simsek ◽  
Takao Komatsu
Keyword(s):  
Generating Functions ◽  
Functional Equations ◽  
Stirling Numbers ◽  
Bernoulli Numbers ◽  
Euler Numbers ◽  
Special Polynomials ◽  
Central Factorial Numbers

The aim of this paper is to give some new identities and relations related to the some families of special numbers such as the Bernoulli numbers, the Euler numbers, the Stirling numbers of the first and second kinds, the central factorial numbers and also the numbers y1(n,k,?) and y2(n,k,?) which are given Simsek [31]. Our method is related to the functional equations of the generating functions and the fermionic and bosonic p-adic Volkenborn integral on Zp. Finally, we give remarks and comments on our results.

scholarly journals On transformations of formal power series

2003 ◽  
Vol 184 (2) ◽  
pp. 369-383 ◽  
Author(s):  
Manfred Droste ◽  
Guo-Qiang Zhang
Keyword(s):  
Power Series ◽  
Formal Power Series ◽  
Formal Power

scholarly journals On the Square Root of a Bell Matrix

2021 ◽  
Vol 76 (1) ◽  
Author(s):  
Donatella Merlini
Keyword(s):  
Power Series ◽  
Closed Form ◽  
Formal Power Series ◽  
Computational Method ◽  
Square Root ◽  
Riordan Arrays ◽  
Formal Power

AbstractIn the context of Riordan arrays, the problem of determining the square root of a Bell matrix $$R={\mathcal {R}}(f(t)/t,\ f(t))$$ R = R ( f ( t ) / t , f ( t ) ) defined by a formal power series $$f(t)=\sum _{k \ge 0}f_kt^k$$ f ( t ) = ∑ k ≥ 0 f k t k with $$f(0)=f_0=0$$ f ( 0 ) = f 0 = 0 is presented. It is proved that if $$f^\prime (0)=1$$ f ′ ( 0 ) = 1 and $$f^{\prime \prime }(0)\ne 0$$ f ″ ( 0 ) ≠ 0 then there exists another Bell matrix $$H={\mathcal {R}}(h(t)/t,\ h(t))$$ H = R ( h ( t ) / t , h ( t ) ) such that $$H*H=R;$$ H ∗ H = R ; in particular, function h(t) is univocally determined by a symbolic computational method which in many situations allows to find the function in closed form. Moreover, it is shown that function h(t) is related to the solution of Schröder’s equation. We also compute a Riordan involution related to this kind of matrices.

Sign in / Sign up

Export Citation Format

Share Document