Related papers: Enumeration of multiplex juggling card sequences u…
Consider the set of all powers $\text{GL}(n ,q)^M = \{x^M \mid x\in \text{GL}(n, q)\}$ for an integer $M\geq 2$. In this article, we aim to enumerate the regular, regular semisimple and semisimple elements as well as conjugacy classes in…
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…
We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…
A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…
We construct new integral representations for transformations of the ordinary generating function for a sequence, $\langle f_n \rangle$, into the form of a generating function that enumerates the corresponding "square series" generating…
Consider a card guessing game with complete feedback in which a deck of $n$ cards ordered $1,\dots, n$ is riffle-shuffled once. With the goal to maximize the number of correct guesses, a player guesses cards from the top of the deck one at…
Recently, Kim and Oh expressed the Selberg integral in terms of the number of Young books which are a generalization of standard Young tableaux of shifted staircase shape. In this paper the generating function for Young books according to…
We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
We study the algebra MD of generating function for multiple divisor sums and its connections to multiple zeta values. The generating functions for multiple divisor sums are formal power series in q with coefficients in Q arising from the…
We compute the generating function for the characters of the irreducible representations of SU(n) whose associated Young diagrams have only two rows with the same number of boxes. The result is a rational determinantal expression in which…
In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…
A formula is derived that provides generating functions for any multi-j-symbol, such as the 3-j-symbol, the 6-j-symbol, the 9-j-symbol, etc. The result is completely determined by geometrical objects (loops and curves) in the graph of the…
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…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
In the present paper, we prove an identity for the generating function of the quadruple zeta values. Taking homogeneous parts on both sides of the identity and substituting appropriate values for the variables, we obtain the sum formula for…
Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
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…