Left-to-right maxima in words and multiset permutations
classification
🧮 math.CO
keywords
givenleft-to-rightmaximamultisetpermutationswordsalphabetclassical
read the original abstract
We extend classical theorems of Renyi by finding the distributions of the numbers of both weak and strong left-to-right maxima (a.k.a. outstanding elements) in words over a given alphabet and in permutations of a given multiset.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.