Computation methods for combinatorial sums and Euler-type numbers related to new families of numbers
Publication:2988683
DOI10.1002/mma.4143zbMath1430.11033arXiv1604.05608OpenAlexW3100178808MaRDI QIDQ2988683
Publication date: 19 May 2017
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.05608
generating functionsStirling numbersfunctional equationsbinomial coefficientsEuler numbers and polynomialsbinomial sumcentral factorial numbersarray polynomialscombinatorial sum
Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Bernoulli and Euler numbers and polynomials (11B68) Combinatorics in computer science (68R05) Recurrences (11B37)
Related Items (19)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modification and unification of the Apostol-type numbers and polynomials and their applications
- Some array type polynomials associated with special numbers and polynomials
- Rook polynomials in three and higher dimensions
- Some new identities of Frobenius-Euler numbers and polynomials
- Special functions related to Dedekind-type DC-sums and their applications
- Identities involving Frobenius-Euler polynomials arising from non-linear differential equations
- Some generalizations of the Apostol-Genocchi polynomials and the Stirling numbers of the second kind
- A multiplication theorem for the Lerch zeta function and explicit representations of the Bernoulli and Euler polynomials
- A new extension of \(q\)-Euler numbers and polynomials related to their interpolation functions
- On Euler numbers, polynomials and related \(p\)-adic integrals
- Identities associated with generalized Stirling type numbers and Eulerian type polynomials
- \(q\)-analogue of twisted \(l\)-series and \(q\)-twisted Euler numbers
- A research on the new polynomials involved with the central factorial numbers, Stirling numbers and others polynomials
- Combinatorial sums and finite differences
- Some relationships between the analogs of Euler numbers and polynomials
- Generating functions and generalized Euler numbers
- Some identities and congruences involving a certain family of numbers
- q-Bernstein polynomials related to q-Frobenius-Euler polynomials, l-functions, and q-Stirling numbers
- Srivastava-Pintér theorems for 2D-Appell polynomials and their applications
- Analysis of the Bernstein basis functions: an approach to combinatorial sums involving binomial coefficients and Catalan numbers
This page was built for publication: Computation methods for combinatorial sums and Euler-type numbers related to new families of numbers