Related papers: Generating functions for purely crossing partition…

Recently, Chan and Wang (Fractional powers of the generating function for the partition function. Acta Arith. 187(1), 59--80 (2019)) studied the fractional powers of the generating function for the partition function and found several…

The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…

In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If…

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…

We give the generating function for the index of integer lattice points, relative to a finite order ideal. The index is an important concept in the theory of border bases, an alternative to Gr\"obner bases. Equivalently, we explicitly solve…

We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of…

We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…

Let $T$ be an underlying space with a non-atomic measure $\sigma$ on it. In [{\it Comm.\ Math.\ Phys.}\ {\bf 292} (2009), 99--129] the Meixner class of non-commutative generalized stochastic processes with freely independent values,…

We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…

In this chapter, we discuss normal generators for mapping class groups of surfaces. Especially, we focus on the relation between normal generation of a mapping class with its asymptotic translation lengths on the Teichm\"uller space and the…

We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…

We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.

In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…

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…

Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

A redundant generating function is a generating function having terms which are not part of the solution of the original problem. We use redundant generating functions to study two path problems. In the first application we explain a…

We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…