Sorting inversion sequences

DOI10.46298/DMTCS.14010MaRDI QIDQ6987003zbMATH OpenFDO

Authors Toufik Mansour, Howard Skogman, Rebecca Smith

Publication date 7 May 2025

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.14010

zbMATH Keywords

generating treeinversion sequencepermutation patternpop stacksorting algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10)

Cites work

• \(k\)-pop stack sortable permutations and \(2\)-avoidance
• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Crystal pop-stack sorting and type \(A\) crystal lattices
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Generalized Stack Permutations
• scientific article; zbMATH DE number 3156373 (Why is no real title available?)
• scientific article; zbMATH DE number 3722110 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Inversion sequences avoiding a triple of patterns of 3 letters
• Inversion sequences avoiding pairs of patterns
• Inversion sequences avoiding quadruple length-3 patterns
• Passing through a stack \(k\) times with reversals
• Passing through a stack k times
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Patterns of relation triples in inversion and ascent sequences
• Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
• Permutations generated by a stack of depth 2 and an infinite stack in series
• Permutations sorted by a finite and an infinite stack in series
• Pop-stack sorting and its image: permutations with overlapping runs
• Pop-stacks in parallel
• Refined restricted inversion sequences
• Restricted permutations
• Sorting Cayley permutations with pattern-avoiding machines
• Sorting with two ordered stacks in series.
• Stack sorting with restricted stacks
• Sur la numération factorielle, application aux permutations.
• The enumeration of inversion sequences avoiding the patterns 201 and 210
• The enumeration of permutations sortable by pop stacks in parallel
• The pop-stack-sorting operator on Tamari lattices
• Two stacks in series: a decreasing stack followed by an increasing stack
• Two-stack-sorting with pop stacks

Cited in

(1)

• Sorting permutations using a pop stack with a bypass

This page was built for publication: Sorting inversion sequences

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