Related papers: Bivariate Generating Functions for a Class of Line…

In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…

We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…

We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic…

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…

We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…

In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.

The Brenke type generating functions are the polynomial generating functions of the form $$\sum_{n=0}^{\infty}{P_n(x )\over n!}t^n=A(t)B(xt), $$ where $A$ and $B$ are two formal power series subject to the conditions…

We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…

We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…

In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…

In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…