Record statistics in integer compositions
A $\textit{composition}$ $\sigma =a_1 a_2 \ldots a_m$ of $n$ is an ordered collection of positive integers whose sum is $n$. An element $a_i$ in $\sigma$ is a strong (weak) $\textit{record}$ if $a_i> a_j (a_i \geq a_j)$ for all $j=1,2,\ldots,i-1$. Furthermore, the position of this record is $i$....
Main Authors: | Arnold Knopfmacher, Toufik Mansour |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2009-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2691/pdf |
Similar Items
-
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Staircase Macdonald polynomials and the $q$-Discriminant
by: Adrien Boussicault, et al.
Published: (2008-01-01) -
Indecomposable permutations with a given number of cycles
by: Robert Cori, et al.
Published: (2009-01-01) -
A product formula for the TASEP on a ring
by: Erik Aas, et al.
Published: (2014-01-01)