Two-stack-sorting with pop stacks (Q5197592)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7106989

Language	Label	Description	Also known as
English	Two-stack-sorting with pop stacks	scientific article; zbMATH DE number 7106989

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

publication date

19 September 2019

0 references

full work available at URL

https://arxiv.org/abs/1801.05005

0 references

http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p179.pdf

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

forbidden patterns

0 references

polyominoes

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

arXiv classification

math.CO

0 references

0 references

Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3

0 references

Formulae for Polyominoes on Twisted Cylinders

0 references

Pop-stacks in parallel

0 references

Restricted permutations and the wreath product

0 references

0 references

Enumerating permutations sortable by \(k\) passes through a pop-stack

0 references

0 references

The on-line encyclopedia of integer sequences

0 references

0 references

The enumeration of permutations sortable by pop stacks in parallel

0 references

A stack and a pop stack in series

0 references

Sorting Using Networks of Queues and Stacks

0 references

A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5197592

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5197592&oldid=36524961"