Permutations generated by a depth 2 stack and an infinite stack in series are algebraic

zbMath1311.05005arXiv1407.4248MaRDI QIDQ2344818

Geoffrey Lee, Murray J. Elder, Andrew Rechnitzer

Publication date: 18 May 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

context-free languagepattern avoiding permutationalgebraic generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Related Items (1)

Permutations sortable by two stacks in series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutations sortable by two stacks in parallel and quarter plane walks
• Symmetric functions and P-recursiveness
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations generated by token passing in graphs
• Regular closed sets of permutations.
• Sorting with two ordered stacks in series.
• On \(1324\)-avoiding permutations
• Counting 1324, 4231-avoiding permutations
• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
• Permutations generated by a stack of depth 2 and an infinite stack in series
• The insertion encoding of permutations
• 2-Stack Sorting is polynomial
• Restricted permutations

This page was built for publication: Permutations generated by a depth 2 stack and an infinite stack in series are algebraic