Catalan and Schröder permutations sortable by two restricted stacks

DOI10.1016/j.ipl.2021.106138OpenAlexW3162311554MaRDI QIDQ2032179

Giulio Cerbai, Jean-Luc Baril, Carine Khalil, Vicentiu Vajnovszki

Publication date: 16 June 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.01812

zbMATH Keywords

combinatorial problemsCatalan and the Schröder numberspattern avoiding permutations/machinesstack sorting/two stacks in series

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

Stack-sorting for Coxeter groups ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Highly sorted permutations with respect to a 312-avoiding stack ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Restricted stacks as functions ⋮ Stack-sorting with consecutive-pattern-avoiding stacks

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Permutation pattern avoidance and the Catalan triangle
• Patterns in permutations and words.
• A Catalan triangle
• Some combinatorial interpretations of \(q\)-analogs of Schröder numbers
• A weight-preserving bijection between Schröder paths and Schröder permutations
• Counting with Borel's triangle
• Generating trees and the Catalan and Schröder numbers
• Sorting with pattern-avoiding stacks: the \(132\)-machine
• Stack sorting with restricted stacks

This page was built for publication: Catalan and Schröder permutations sortable by two restricted stacks