A simple sorting algorithm for compositions

DOI10.1142/S1793830920500792MaRDI QIDQ5859489zbMATH OpenOpenAlexFDO

Authors Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour

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

asymptoticscompositionsgenerating function

Mathematics Subject Classification ID

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

Recommendations

• Pushes in words -- a primitive sorting algorithm
• scientific article; zbMATH DE number 7362651
• New refined enumerations of set partitions related to sorting
• Compositions with a fixed number of inversions
• Greatest descents after any maxima in compositions

Cites work

• Analytic combinatorics
• Gap-free compositions and gap-free samples of geometric random variables
• Greatest descents after any maxima in compositions
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• Inversions in compositions of integers
• On Carlitz compositions
• On the probability that certain compositions have the same number of parts
• Record statistics in a random composition
• Smooth compositions and smooth words
• Successions in words and compositions
• The largest missing value in a composition of an integer
• The statistical mechanics of interacting walks, polygons, animals and vesicles
• Variation statistics on compositions

Cited in

(2)

• scientific article; zbMATH DE number 5124574 (Why is no real title available?)
• Pushes in words -- a primitive sorting algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859489)