Journal of Combinatorics

Volume 10 (2019)

Number 2

The combinatorics of weighted vector compositions

Pages: 291 – 325

DOI: https://dx.doi.org/10.4310/JOC.2019.v10.n2.a7

Author

Steffen Eger (Technical University Darmstadt, Germany)

Abstract

A vector composition of a vector $\ell$ is a matrix $\mathbf{A}$ whose rows sum to $\ell$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different colors. We study vector compositions from different viewpoints: (1) We show how they are related to sums of random vectors and (2) how they allow to derive formulas for partial derivatives of composite functions. (3) We study congruence properties of the number of weighted vector compositions, for fixed and arbitrary number of parts, many of which are analogous to those of ordinary binomial coefficients and related quantities. Via the Central Limit Theorem and their multivariate generating functions, (4) we also investigate the asymptotic behavior of several special cases of numbers of weighted vector compositions. Finally, (5) we conjecture an extension of a primality criterion due to Mann and Shanks in the context of weighted vector compositions.

Keywords

vector composition, weighted composition, sum of random variables, partial derivatives, congruences

The full text of this article is unavailable through your IP address: 54.165.57.161

Received 7 October 2017

Published 25 January 2019