| http://dbpedia.org/ontology/abstract
|
In mathematics and computer science, a sta … In mathematics and computer science, a stack-sortable permutation (also called a tree 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.ion including Dyck paths and binary trees.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Tree_permutation_bijection.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.combinatorics.org/Volume_9/Abstracts/v9i2a1.html +
|
| http://dbpedia.org/ontology/wikiPageID
|
39287529
|
| http://dbpedia.org/ontology/wikiPageLength
|
11738
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1032262803
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Recursion +
, http://dbpedia.org/resource/Longest_increasing_subsequence +
, http://dbpedia.org/resource/Permutation_graph +
, http://dbpedia.org/resource/Inversion_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Edit_distance +
, http://dbpedia.org/resource/Stack_%28abstract_data_type%29 +
, http://dbpedia.org/resource/Trivially_perfect_graph +
, http://dbpedia.org/resource/Preorder +
, http://dbpedia.org/resource/Separable_permutation +
, http://dbpedia.org/resource/File:Tree_permutation_bijection.svg +
, http://dbpedia.org/resource/Polynomial_time +
, http://dbpedia.org/resource/Inorder +
, http://dbpedia.org/resource/Discrete_Mathematics_%28journal%29 +
, http://dbpedia.org/resource/Catalan_number +
, http://dbpedia.org/resource/Edge_contraction +
, http://dbpedia.org/resource/Uniform_distribution_%28discrete%29 +
, http://dbpedia.org/resource/Dynamic_programming +
, http://dbpedia.org/resource/Mathematics +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Binary_tree +
, http://dbpedia.org/resource/Bijection +
, http://dbpedia.org/resource/Sorting_algorithm +
, http://dbpedia.org/resource/Permutation_pattern +
, http://dbpedia.org/resource/The_Art_of_Computer_Programming +
, http://dbpedia.org/resource/Journal_of_the_ACM +
, http://dbpedia.org/resource/Dyck_path +
, http://dbpedia.org/resource/Category:Permutation_patterns +
, http://dbpedia.org/resource/Comparison_sort +
, http://dbpedia.org/resource/Permutation +
, http://dbpedia.org/resource/Linear_time +
, http://dbpedia.org/resource/Dyck_language +
, http://dbpedia.org/resource/Enumerative_combinatorics +
, http://dbpedia.org/resource/Expected_value +
, http://dbpedia.org/resource/All_nearest_smaller_values +
, http://dbpedia.org/resource/Combinatorial_class +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Harvtxt +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Permutation_patterns +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Permutation +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Stack-sortable_permutation?oldid=1032262803&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Tree_permutation_bijection.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Stack-sortable_permutation +
|
| owl:sameAs |
http://dbpedia.org/resource/Stack-sortable_permutation +
, http://yago-knowledge.org/resource/Stack-sortable_permutation +
, http://www.wikidata.org/entity/Q17103625 +
, https://global.dbpedia.org/id/fARi +
, http://rdf.freebase.com/ns/m.0t_fjg7 +
|
| rdf:type |
http://dbpedia.org/class/yago/Form105930736 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Structure105726345 +
, http://dbpedia.org/class/yago/WikicatPermutationPatterns +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Cognition100023271 +
|
| rdfs:comment |
In mathematics and computer science, a sta … In mathematics and computer science, a stack-sortable permutation (also called a tree 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.ion including Dyck paths and binary trees.
|
| rdfs:label |
Stack-sortable permutation
|
