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

MaRDI QIDQ2500987zbMATH OpenFDO

Authors Murray Elder

Publication date 30 August 2006

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

Full work available at URL https://arxiv.org/abs/math/0510244, https://eudml.org/doc/126450, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r68.html

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

zbMATH Keywords

forbidden patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

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.

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

Cited in

(6)

• Passing through a stack k times
• Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
• Passing through a stack \(k\) times with reversals
• Permutations sorted by a finite and an infinite stack in series
• Combinatorial generation via permutation languages. I: Fundamentals
• scientific article; zbMATH DE number 3772962 (Why is no real title available?)

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)