A simple sorting algorithm for compositions

DOI10.1142/S1793830920500792zbMath1458.05013OpenAlexW3034790683MaRDI QIDQ5859489

Toufik Mansour, Charlotte Brennan, Aubrey Blecher, Arnold Knopfmacher

Publication date: 16 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500792

zbMATH Keywords

compositionsasymptoticsgenerating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Record statistics in a random composition
• The largest missing value in a composition of an integer
• On the probability that certain compositions have the same number of parts
• Greatest descents after any maxima in compositions
• On Carlitz compositions
• Gap-free compositions and gap-free samples of geometric random variables
• Successions in words and compositions
• Inversions in compositions of integers
• Variation Statistics on Compositions

This page was built for publication: A simple sorting algorithm for compositions