The combinatorics of weighted vector compositions
From MaRDI portal
Abstract: A vector composition of a vector is a matrix whose rows sum to . We define a weighted vector composition as a vector composition in which the column values of 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.
Recommendations
- Some Elementary Congruences for the Number of Weighted Integer Compositions
- scientific article; zbMATH DE number 6533395
- A proof of the Mann-Shanks primality criterion conjecture for extended binomial coefficients
- On vectorized weighted sum formulas of multiple zeta values
- Some formulas for numbers of restricted words
Cited in
(6)- The image of weighted combinatorial problems
- Power vectors, combinatorial vector numbers and its theory of functions
- Typical values of extremal-weight combinatorial structures with independent symmetric weights
- Vector weighted Stirling numbers and an application in graph theory
- scientific article; zbMATH DE number 5042863 (Why is no real title available?)
- The minimum weight \(t\)-composition of an integer
This page was built for publication: The combinatorics of weighted vector compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713789)