Flip-sort and combinatorial aspects of pop-stack sorting
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present several structural, enumerative, and algorithmic results on permu...
Main Authors: | Andrei Asinowski, Cyril Banderier, Benjamin Hackl |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2021-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6196/pdf |
Similar Items
-
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
by: Colin Defant
Published: (2021-04-01) -
Down-step statistics in generalized Dyck paths
by: Andrei Asinowski, et al.
Published: (2022-05-01) -
Growing and Destroying Catalan-Stanley Trees
by: Benjamin Hackl, et al.
Published: (2018-02-01) -
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
by: Colin Defant
Published: (2019-10-01) -
The permutation class Av(4213,2143)
by: David Bevan
Published: (2017-04-01)