Stack-sortable permutation
id:
stack-sortable-permutation-297-315944
title:
Stack-sortable permutation
text:
In mathematics and computer science, a stack-sortable permutation is a permutation whose elements may be sorted by an algorithm whose internal storage is limited to a single stack data structure. The stack-sortable permutations are exactly the permutations that do not contain the permutation pattern 231; they are counted by the Catalan numbers, and may be placed in bijection with many other combinatorial objects with the same counting function including Dyck paths and binary trees.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Stack-sortable_permutation
date created:
date modified:
2023-11-07T23:52:27Z
main entity:
{"identifier":"Q17103625","url":"https://www.wikidata.org/entity/Q17103625"}
image:
fields total:
13
integrity:
13