Binomial arrays and generalized Vandermonde identities

arXiv1905.01525MaRDI QIDQ6318211FDOQ6318211

Authors: Robert W. jun. Donley 

Publication date: 4 May 2019

Abstract: In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete convolution. Here we begin by introducing the notion of a binomial array and develop several "hockey stick" rules. Then we give an algorithm that generalizes the classical Vandermonde Identity; this produces infinite families of summation formulas, which we use to expand and prove certain combinatorial identities for the Catalan numbers. Finally, we recast the theory in terms of the finite-dimensional representation theory of $SL(2,F)$.

Mathematics Subject Classification ID

Matrices of integers (15B36) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Recurrences (11B37)

This page was built for publication: Binomial arrays and generalized Vandermonde identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6318211)