Related papers: Unified generating function for set partitions
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
In this paper new algorithm for calculating power indices is described. The complexity class of the problem is #P-complete and even calculating power index of the biggest player is NP-hard task. Constructed algorithm is a mix of ideas of…
Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…
We demonstrate that statistics of certain classes of set partitions is described by generating functions related to the Burgers, Ibragimov--Shabat and Korteweg--de Vries integrable hierarchies.
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…
In this paper, we study the generating functions of multiple $t$-star values with an arbitrary number of blocks of twos, which are based on the results of the corresponding generating functions of multiple $t$-harmonic star sums. These…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
The purpose of this paper is to find an explicit formula and asymptotic estimate for the total number of sum of weighted records over set partitions of $[n]$ in terms of Bell numbers. For that we study the generating function for the number…
The notion of generating functions of Poisson structures was first studied in math.SG/0312380.They are special functions which induce, on open subsets of $\R^d$, a Poisson structure together with the local symplectic groupoid integrating…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
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…
Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $\varphi_{z}$ and $\psi_{z}$, along with their combinatorial interpretations. Through these operators, we derive…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
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 consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
An alternative generating function is proposed to enumerate row-convex polyominoes without internal holes on a discrete grid. The approach is based on integer partitions of the total area, where each partition corresponds to a sequence of…