On a Balanced Property of Compositions
Miklos Bona
Abstract
Let S be a finite set of positive integers with largest element m. Let us randomly select a composition a of the integer n with parts in S, and let m(a) be the multiplicity of m as a part of a. Let 0≤ r<q be integers, with q≥ 2, and let pn,r be the probability that m(a) is congruent to r modulo q. We show that if S satisfies a certain simple condition, then n ∞ pn,r =1/q. In fact, we show that an obvious necessary condition on S turns out to be sufficient.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell