Pushes in words -- a primitive sorting algorithm

zbMATH Open1490.05007MaRDI QIDQ5087458FDOQ5087458

Authors: Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour 

Publication date: 1 July 2022

Full work available at URL: https://cdm.ucalgary.ca/article/view/67951

Recommendations

• scientific article; zbMATH DE number 7362651
• A simple sorting algorithm for compositions
• Stack-sorting for words
• New refined enumerations of set partitions related to sorting
• Counting Stirling permutations by number of pushes

zbMATH Keywords

asymptoticsgenerating functionwordssorting

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Analytic combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Words restricted by patterns with at most 2 distinct letters
• Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method
• Combinatorics of geometrically distributed random variables: Left-to-right maxima
• Successions in words and compositions
• Left-to-right maxima in words and multiset permutations
• A statistic related to trees and words on a finite alphabet
• Smooth compositions and smooth words
• The perimeter of words
• Shedding light on words

Cited In (2)

• A simple sorting algorithm for compositions
• Title not available (Why is that?)

This page was built for publication: Pushes in words -- a primitive sorting algorithm

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