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

zbMATH Open1097.05002arXivmath/0510244MaRDI QIDQ2500987FDOQ2500987

Authors: Murray Elder 

Publication date: 30 August 2006

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

Abstract: We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutations of length 5, 6, 7 and 8. We prove this via a ``canonical generating algorithm.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Permutations sorted by a finite and an infinite stack in series
• Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
• Sorting with two ordered stacks in series.
• scientific article; zbMATH DE number 3772962
• scientific article; zbMATH DE number 1836429

zbMATH Keywords

forbidden patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited In (6)

• Passing through a stack \(k\) times with reversals
• Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
• Combinatorial generation via permutation languages. I: Fundamentals
• Passing through a stack k times
• Permutations sorted by a finite and an infinite stack in series
• Title not available (Why is that?)

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

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