The enumeration of sequences with restrictions on their partial sums
Summary: We examine sequences containing \(p\) ``\(-t\)s and \(pt+r\) ``\(+1\)s, where \(p\), \(t\), and \(r\) are integers satisfying \(p\geq 0\), \(t\geq 1\) and \(pt+r\geq 0\). We develop a rotation method to enumerate the number of sequences meeting additional requirements related to their partial sums. We also define downcrossings about \(\ell\) and their downcrossing numbers, and obtain formulas for the number of sequences for which the sum of the downcrossing numbers equals \(k\), for \(\ell\leq r+1\). We finish with an investigation of the first downcrossing number about \(\ell\), for any \(\ell\).
- Up-down sequences: inversions, coinversions, and the sum of major indices
- scientific article; zbMATH DE number 3095538
- Enumeration problems of sets of increasing and decreasing n-valued serial sequences with double-ended constraints on series heights
- Enumerative problems solution for single-transition serial sequences with an adjacent series heights increment bounded from above
- Algorithms for enumeration of single-transition serial sequences
This page was built for publication: The enumeration of sequences with restrictions on their partial sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612945)
