[Paper Review] On a Combinatorial Identity of Djakov and Mityagin

Steven Rosenberg|arXiv (Cornell University)|May 28, 2012

Advanced Combinatorial Mathematics3 references3 citations

TL;DR

This paper provides a new, direct combinatorial proof of a symmetric identity between two types of subset sums over integers: one involving squares of elements in subsets of the same parity, and another involving products of elements and their complements. The proof uses the characteristic polynomial of a tridiagonal matrix (the Kac matrix) computed in two ways, yielding the identity via coefficient comparison.

ABSTRACT

Consider a pyramid made out of unit cubes arranged in square horizontal layers, with a ledge of one cube's length around the perimeter of each layer. For any natural number $k$, we can count the number of ways of choosing $k$ unit cubes from the pyramid such that no two cubes are in the same horizontal layer; we can also count the number of ways of choosing $k$ unit cubes from the pyramid such that no two cubes come from the same vertical slice (taken parallel to a fixed edge of the pyramid) {\it or} from two adjacent slices. Djakov and Mityagin first established, using functional analysis, that these two quantities are always equal (the enumerative interpretation given here is due to Thomas Kalinowski). Don Zagier supplied the first combinatorial proof of this result. We provide a new, more natural combinatorial proof.

Motivation & Objective

• To provide a more natural and direct combinatorial proof of a symmetric identity previously established via functional analysis and later by Zagier using combinatorial means.
• To establish the equality of two distinct subset sum expressions: one over subsets of equal parity and another over non-consecutive subsets.
• To demonstrate that the coefficients of the characteristic polynomial of a specific tridiagonal matrix (the Kac matrix) encode both combinatorial sum structures.
• To unify the combinatorial and algebraic perspectives by computing the same polynomial in two ways, thereby proving the identity without prior assumptions.

Proposed method

• Define a tridiagonal matrix $ M_n $ with entries $ a_i = i $ and $ b_i = n+1-i $, forming the Kac matrix $ S_n $.
• Compute the characteristic polynomial $ \chi_n(x) = \det(xI - M_n) $ using determinant expansion and recurrence relations.
• Derive a recurrence for the coefficients $ d_{k,n} $ of $ x^{n+1-2k} $, showing they match the sum over non-consecutive $ k $-subsets.
• Use eigenvector construction via polynomial interpolation to compute the eigenvalues of $ S_n $, yielding $ \lambda = n - 2d $ for $ d = 0,1,\dots,n $.
• Express the characteristic polynomial as $ \chi_n(x) = \prod_{d=0}^n (x - (n - 2d)) $, which simplifies to a product of quadratic and linear terms.
• Compare the two expressions for $ d_{k,n} $: one from the recurrence and one from the eigenvalue-based expansion, to prove the identity.

Experimental results

Research questions

• RQ1 Can the identity between the sum over same-parity $ k $-subsets and the sum over non-consecutive $ k $-subsets be proven combinatorially in a more natural way?
• RQ2 How do the coefficients of the characteristic polynomial of the Kac matrix relate to combinatorial subset sums?
• RQ3 What is the spectrum of the Kac matrix $ S_n $, and how does it reflect the structure of the identity?
• RQ4 Can the identity be derived by computing the same polynomial in two distinct algebraic ways?

Key findings

• The coefficient of $ x^{n+1-2k} $ in the characteristic polynomial of the Kac matrix $ S_n $ is given by $ (-1)^k \sum_{J \in \binom{[n]}{k}^{**}} \prod_{j \in J} j(n+1-j) $, where $ \binom{[n]}{k}^{**} $ denotes non-consecutive $ k $-subsets.
• The same coefficient is also equal to $ (-1)^k \sum_{J \in \binom{[n]}{k}^{*}} \prod_{j \in J} j^2 $, where $ \binom{[n]}{k}^{*} $ denotes $ k $-subsets of elements all congruent to $ n \mod 2 $.
• The eigenvalues of $ S_n $ are $ n - 2d $ for $ d = 0,1,\dots,n $, with multiplicity one each, leading to the characteristic polynomial $ \chi_n(x) = \prod_{d=0}^n (x - (n - 2d)) $.
• The characteristic polynomial simplifies to $ x^\varepsilon \cdot \prod_{\substack{1 \leq j \leq n \\ j \equiv n \pmod{2}}} (x^2 - j^2) $, where $ \varepsilon = 0 $ if $ n $ is odd and $ \varepsilon = 1 $ if $ n $ is even.
• The equality of the two expressions for $ d_{k,n} $ confirms the identity $ \sum_{J \in \binom{[n]}{k}^{*}} \prod_{j \in J} j^2 = \sum_{J \in \binom{[n]}{k}^{**}} \prod_{j \in J} j(n+1-j) $.