Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A stack and a pop stack in series

From MaRDI portal
Publication:2875490
Jump to:navigation, search

zbMath1295.05023arXiv1303.1395MaRDI QIDQ2875490

No author found.

Publication date: 15 August 2014

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


zbMATH Keywords

sorting machinesenumeration of the sortable permutations


Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)


Related Items (7)

Nine classes of permutations enumerated by binomial transform of Fine's sequence ⋮ Counting Pop-Stacked Permutations in Polynomial Time ⋮ Ungarian Markov chains ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Passing through a stack \(k\) times with reversals ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Two-stack-sorting with pop stacks


Uses Software

  • OEIS
  • PermLab






This page was built for publication: A stack and a pop stack in series

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2875490&oldid=15825136"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki