Related papers: Motzkin numbers of higher rank: Generating functio…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
The enumeration of standard Young tableaux (SYTs) of shape {\lambda} can be easily computed by the hook-length formula. In 1981, Amitai Regev proved that the number of SYTs having at most three rows with n entries equals the nth Motzkin…
We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…
We present new proofs of eight integral representations of the Catalan numbers. Then, we create analogous integral representations of the Motzkin numbers and obtain new results. Most integral representations of counting sequences found in…
This paper describes a sequence of natural numbers that grows faster than any Turing computable function. This sequence is generated from a version of the tiling problem, called a coloring system. In our proof that generates the sequence,…
Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.
In this paper, we introduce the concept of the (higher order) Appell-Carlitz numbers which unifies the definitions of several special numbers in positive characteristic, such as the Bernoulli-Carlitz numbers and the Cauchy-Carlitz…
We study generating functions for multiple zeta star values in general form. These generating functions provide a connection between multiple zeta star values and multiple Euler sums, which allows us to express each multiple zeta star value…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
In this paper, we give a new proof and an extension of the following result of B\'ezivin. Let $f:\B{N}\to K$ be a multiplicative function taking values in a field $K$ of characteristic 0 and write $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ for…
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
We prove that the generating function of overpartition $M2$-rank differences is, up to coefficient signs, a component of the vector-valued mock Eisenstein series attached to a certain quadratic form. We use this to compute analogs of the…
We give new explicit representations as well as new generating functions for the associated Meixner, Charlier, Laguerre, and Krawtchouk polynomials. The obtained results are then used to derive new generating functions and convolution-type…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
We consider the Banzhaf-Coleman and Owen power indices for weighted majority games modified by a coalition configuration. We present calculation algorithms of them that make use of the method of generating functions. We programmed the…
New recursion relations for the Riemann zeta function are introduced. Their derivation started from the standard functional equation. The new functional equations have both real and imaginary increment versions and can be applied over the…
We prove that any class of permutations defined by avoiding a partially ordered pattern (POP) with height at most two has a regular insertion encoding and thus has a rational generating function. Then, we use Combinatorial Exploration to…
The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…
The recent theorem by D. Luecking that finite rank Toeplitz-Bergman operators must be generated by a measure consisting of finitely many point masses is carried over to the many-dimensional case.