[Paper Review] An Enumerative Function

Milan Janjić|ArXiv.org|Jan 13, 2008

Advanced Combinatorial Mathematics1 references3 citations

TL;DR

This paper introduces an enumerative function $F(n,k,P,m)$ that generalizes binomial coefficients, factorials, and rising/falling factorials by counting $n+k$-insets—subsets intersecting all $n$ main blocks of a set with $n$ blocks of sizes $p_1,\dots,p_n$ and an additional $m$-block. The key contribution is a unified combinatorial framework that extends Vandermonde convolution and provides a pure combinatorial definition for Chebyshev polynomials via recurrence relations.

ABSTRACT

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 an introduction. In the second section we derive an explicit formula for F. From the expression for the power function we obtain a number theory result. Then we derive a formula which shows that the case of arbitrary m may be reduced to the case m=0. This formula extends Vandermonde convolution. In the second section we describe F by the series of recurrence relations with respect to each of arguments k, n, and P. As a special case of the first recurrence relation we state a binomial identity. As a consequence of the second recurrence relation we obtain relation for coefficients of Chebyshev polynomial of both kind. This means that these polynomials might be defined in pure combinatorial way.

Motivation & Objective

• To define a generalized enumerative function $F(n,k,P,m)$ that unifies binomial coefficients, factorials, and rising/falling factorials.
• To derive an explicit formula for $F(n,k,P,m)$ using inclusion-exclusion (PIE), showing it as an alternating sum of binomial coefficients.
• To prove that the general case with arbitrary $m$ reduces to the $m=0$ case, extending Vandermonde convolution.
• To establish recurrence relations for $F(n,k,P,m)$ with respect to $n$, $k$, and $P$, revealing connections to Chebyshev polynomials.
• To show that Chebyshev polynomials of both kinds can be defined purely combinatorially via the coefficients of $F(n,k,P,m)$.

Proposed method

• Use of the principle of inclusion-exclusion (PIE) to derive an explicit formula: $F(n,k,P,m) = \sum_{I \subseteq [n]} (-1)^{|I|} \binom{N - \sum_{i \in I} p_i}{n+k}$, where $N = \sum p_i + m$.
• Derivation of a reduction formula: $F(n,k,P,m) = \sum_{i=0}^{\min(m,k)} \binom{m}{i} F(n,k-i,P,0)$, showing that $m > 0$ reduces to $m = 0$.
• Establishment of recurrence relations: $F(n,k,P,m) = \sum_{i=1}^{p_j} \binom{p_j}{i} F(n-1,k-i+1,P\setminus\{p_j\},m)$ for each $j \in [n]$, with respect to the number of blocks.
• Proof that when all $p_i = 2$, the recurrence $c(n,k,m) = 2c(n-1,k,m) + c(n-1,k-1,m)$ matches the recurrence for Chebyshev polynomial coefficients.
• Use of variable substitution $a(r,s) = (-1)^k c(n,k,m)$ to map $F$-coefficients to Chebyshev coefficients, showing they satisfy the standard recurrence $a(r,s) = 2a(r-1,s-1) - a(r-2,s)$.
• Derivation of a general transformation formula: $F(n,k,P,m) = F(n-r,k,Q,m) + \sum_{i=1}^{|I_0|} \sum_{j=0}^i \binom{n}{i} \binom{i}{j} F(n-j,k-i+j,Q,m)$, where $Q$ adjusts block sizes for $i \in I_0$.

Experimental results

Research questions

• RQ1 Can a single enumerative function generalize binomial coefficients, factorials, and rising/falling factorials?
• RQ2 Does the function $F(n,k,P,m)$ admit a closed-form expression via inclusion-exclusion?
• RQ3 Can the case $m > 0$ be reduced to the case $m = 0$, and does this generalize Vandermonde’s convolution?
• RQ4 Do recurrence relations of $F(n,k,P,m)$ with respect to $n$, $k$, and $P$ yield known combinatorial sequences?
• RQ5 Can Chebyshev polynomials of the first and second kind be defined purely combinatorially through the coefficients of $F(n,k,P,m)$?

Key findings

• The explicit formula $F(n,k,P,m) = \sum_{I \subseteq [n]} (-1)^{|I|} \binom{N - \sum_{i \in I} p_i}{n+k}$ generalizes binomial coefficients and yields identities like $p^n = \sum_{i=0}^n (-1)^i \binom{n}{i} \binom{pn + m - pi}{n}$.
• For prime $q$, the identity $q \mid r^q - \binom{rq + m}{q} + \binom{m}{q}$ holds for integers $r > 1$, $m \geq 0$, derived from the $p^n$ identity.
• The reduction formula $F(n,k,P,m) = \sum_{i=0}^{\min(m,k)} \binom{m}{i} F(n,k-i,P,0)$ generalizes Vandermonde’s convolution when $n=1$, recovering $\binom{p+m}{k+1} = \sum_{i=0}^{\min(m,k+1)} \binom{m}{i} \binom{p}{k-i+1}$.
• When all $p_i = 2$, the recurrence $c(n,k,m) = 2c(n-1,k,m) + c(n-1,k-1,m)$ matches the recurrence for Chebyshev polynomial coefficients.
• Coefficients $(-1)^k F(n,k,P,m)$ for $p_i = 2$ satisfy the standard Chebyshev recurrence $a(r,s) = 2a(r-1,s-1) - a(r-2,s)$, proving a combinatorial definition of both kinds of Chebyshev polynomials.
• A general transformation formula expresses $F(n,k,P,m)$ in terms of $F(n-j,k-i+j,Q,m)$, where $Q$ reduces block sizes for a subset of indices, enabling recursive computation.