Exponential generating function of hyperharmonic numbers indexed by arithmetic progressions

2013 ◽  
Vol 11 (5) ◽  
Author(s):  
István Mező
Keyword(s):  
Hypergeometric Function ◽  
Generating Function ◽  
Arithmetic Progressions ◽  
Harmonic Numbers ◽  
Bell Numbers ◽  
Exponential Generating Function ◽  
Hyperharmonic Numbers

AbstractThere is a circle of problems concerning the exponential generating function of harmonic numbers. The main results come from Cvijovic, Dattoli, Gosper and Srivastava. In this paper, we extend some of them. Namely, we give the exponential generating function of hyperharmonic numbers indexed by arithmetic progressions; in the sum several combinatorial numbers (like Stirling and Bell numbers) and the hypergeometric function appear.

scholarly journals On a New Family of Generalized Stirling and Bell Numbers

10.37236/564 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Toufik Mansour ◽  
Matthias Schork ◽  
Mark Shattuck
Keyword(s):  
Closed Form ◽  
Generating Function ◽  
Recursion Relation ◽  
Stirling Numbers ◽  
Combinatorial Interpretation ◽  
Bell Numbers ◽  
New Family ◽  
Exponential Generating Function ◽  
Rook Numbers ◽  
Generalized Stirling Numbers

A new family of generalized Stirling and Bell numbers is introduced by considering powers $(VU)^n$ of the noncommuting variables $U,V$ satisfying $UV=VU+hV^s$. The case $s=0$ (and $h=1$) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as $s$-rook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski's formula is given for these Bell numbers.

Euler-Seidel method for certain combinatorial numbers and a new characterization of Fibonacci sequence

2009 ◽  
Vol 7 (2) ◽  
Author(s):  
István Mező ◽  
Ayhan Dil
Keyword(s):  
Generating Function ◽  
Fibonacci Sequence ◽  
Stirling Numbers ◽  
Second Order ◽  
Seidel Method ◽  
Exponential Generating Function ◽  
Hyperharmonic Numbers ◽  
Recurrence Sequences

AbstractIn this paper we use the Euler-Seidel method for deriving new identities for hyperharmonic and r-Stirling numbers. The exponential generating function is determined for hyperharmonic numbers, which result is a generalization of Gosper’s identity. A classification of second order recurrence sequences is also given with the help of this method.

scholarly journals IDENTITIES OF SYMMETRY FOR GENERALIZED TWISTED BERNOULLI POLYNOMIALS TWISTED BY RAMIFIED ROOTS OF UNITY

2014 ◽  
Vol 60 (1) ◽  
pp. 19-36
Author(s):  
Dae San Kim
Keyword(s):  
Generating Function ◽  
Bernoulli Polynomials ◽  
Roots Of Unity ◽  
Integral Expression ◽  
Power Sums ◽  
Exponential Generating Function

Abstract We derive eight identities of symmetry in three variables related to generalized twisted Bernoulli polynomials and generalized twisted power sums, both of which are twisted by ramified roots of unity. All of these are new, since there have been results only about identities of symmetry in two variables. The derivations of identities are based on the p-adic integral expression of the generating function for the generalized twisted Bernoulli polynomials and the quotient of p-adic integrals that can be expressed as the exponential generating function for the generalized twisted power sums.

scholarly journals Obtaining Easily Sums of Powers on Arithmetic Progressions and Properties of Bernoulli Polynomials by Operator Calculus

2017 ◽  
Vol 9 (5) ◽  
pp. 73
Author(s):  
Do Tan Si
Keyword(s):  
Differential Operator ◽  
Generating Function ◽  
Arithmetic Progression ◽  
Bernoulli Polynomials ◽  
Bernoulli Numbers ◽  
Arithmetic Progressions ◽  
Operator Calculus ◽  
Sums Of Powers ◽  
The Way

We show that a sum of powers on an arithmetic progression is the transform of a monomial by a differential operator and that its generating function is simply related to that of the Bernoulli polynomials from which consequently it may be calculated. Besides, we show that it is obtainable also from the sums of powers of integers, i.e. from the Bernoulli numbers which in turn may be calculated by a simple algorithm.By the way, for didactic purpose, operator calculus is utilized for proving in a concise manner the main properties of the Bernoulli polynomials. 

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.

Random Graphs from a Minor-Closed Class

2009 ◽  
Vol 18 (4) ◽  
pp. 583-599 ◽  
Author(s):  
COLIN McDIARMID
Keyword(s):  
Poisson Distribution ◽  
Random Graph ◽  
Generating Function ◽  
Random Graphs ◽  
Giant Component ◽  
Closed Class ◽  
Exponential Generating Function ◽  
Excluded Minor ◽  
A Minor ◽  
Labelled Graphs

A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a classof labelled graphs has smooth growth; and, for the random graphRnsampled uniformly from then-vertex graphs in, the fragment not in the giant component asymptotically has a simple ‘Boltzmann Poisson distribution’. In particular, asn→ ∞ the probability thatRnis connected tends to 1/A(ρ), whereA(x) is the exponential generating function forand ρ is its radius of convergence.

scholarly journals On some combinatorial identities and harmonic sums

2017 ◽  
Vol 13 (07) ◽  
pp. 1695-1709 ◽  
Author(s):  
Necdet Batir
Keyword(s):  
Integral Representation ◽  
Closed Form ◽  
Generating Function ◽  
Combinatorial Identities ◽  
Harmonic Numbers ◽  
Generalized Harmonic Numbers

For any [Formula: see text] we first give new proofs for the following well-known combinatorial identities [Formula: see text] and [Formula: see text] and then we produce the generating function and an integral representation for [Formula: see text]. Using them we evaluate many interesting finite and infinite harmonic sums in closed form. For example, we show that [Formula: see text] and [Formula: see text] where [Formula: see text] are generalized harmonic numbers defined below.

scholarly journals The Maximum Independent Sets of de Bruijn Graphs of Diameter 3

10.37236/681 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Dustin A. Cartwright ◽  
María Angélica Cueto ◽  
Enrique A. Tobis
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Independent Sets ◽  
De Bruijn Graph ◽  
Alphabet Size ◽  
De Bruijn Graphs ◽  
Exponential Generating Function ◽  
De Bruijn

The nodes of the de Bruijn graph $B(d,3)$ consist of all strings of length $3$, taken from an alphabet of size $d$, with edges between words which are distinct substrings of a word of length $4$. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs $B(d,3)$ and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality.

scholarly journals Closed Forms for Derangement Numbers in Terms of the Hessenberg Determinants

2016 ◽  
Author(s):  
Feng Qi ◽  
Jiao-Lian Zhao ◽  
Bai-Ni Guo
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Higher Order ◽  
Order Derivative ◽  
Exponential Generating Function ◽  
Higher Order Derivative

In the paper, the authors find closed forms for derangement numbers in terms of the Hessenberg determinants, discover a recurrence relation of derangement numbers, present a formula for any higher order derivative of the exponential generating function of derangement numbers, and compute some related Hessenberg and tridiagonal determinants.

scholarly journals On the exponential generating function for non-backtracking walks

2018 ◽  
Vol 556 ◽  
pp. 381-399 ◽  
Author(s):  
Francesca Arrigo ◽  
Peter Grindrod ◽  
Desmond J. Higham ◽  
Vanni Noferini
Keyword(s):  
Generating Function ◽  
Exponential Generating Function
Sign in / Sign up

Export Citation Format

Share Document