Passing through a stack \(k\) times with reversals
From MaRDI portal
Publication:2323106
DOI10.1016/j.ejc.2019.06.008zbMath1420.05007arXiv1808.04199OpenAlexW2885654940MaRDI QIDQ2323106
Publication date: 30 August 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04199
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two stacks in series: a decreasing stack followed by an increasing stack
- Bijections for Entringer families
- Patterns in permutations and words.
- Permutations generated by stacks and deques
- Sorting twice through a stack
- Stack sortable permutations
- Two other interpretations of the Entringer numbers
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- A survey of stack-sorting disciplines
- Generalized permutation patterns and a classification of the Mahonian statistics
- Permutations sorted by a finite and an infinite stack in series
- Sorting with two ordered stacks in series.
- Permutations with forbidden subsequences and a generalized Schröder number
- Two examples of unbalanced Wilf-equivalence
- 2-stack sorting is polynomial
- Permutations generated by a stack of depth 2 and an infinite stack in series
- Two Vignettes On Full Rook Placements
- Egge triples and unbalanced Wilf-equivalence
- Patterns in Inversion Sequences I
- A stack and a pop stack in series
- A Survey of Alternating Permutations
- Generalized permutation patterns -- a short survey
- Passing through a stack k times
- Increasing trees and alternating permutations
- Two-stack-sorting with pop stacks
- Sorting Using Networks of Queues and Stacks
- Generalized pattern avoidance
- Permutations avoiding 4321 and 3241 have an algebraic generating function
This page was built for publication: Passing through a stack \(k\) times with reversals
