Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Separable_permutation> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Separable_permutation abstract "In combinatorial mathematics, a separable permutation is a permutation that can be obtained from the trivial permutation 1 by direct sums and skew sums. Separable permutations may be characterized by the forbidden permutation patterns 2413 and 3142; they are also the permutations whose permutation graphs are cographs and the permutations that realize the series-parallel partial orders. It is possible to test in polynomial time whether a given separable permutation is a pattern in a larger permutation, or to find the longest common subpattern of two separable permutations.".
- Separable_permutation thumbnail Separable_Permutation_qtl1.svg?width=300.
- Separable_permutation wikiPageID "24360777".
- Separable_permutation wikiPageRevisionID "587721891".
- Separable_permutation caption "Block structuring of the permutation matrix of the separable permutation and corresponding labeled binary tree; colors indicate depth in the tree".
- Separable_permutation direction "vertical".
- Separable_permutation hasPhotoCollection Separable_permutation.
- Separable_permutation image "Separable Permutation qtl1.svg".
- Separable_permutation image "Separable permutation qtl2.svg".
- Separable_permutation subject Category:Permutation_patterns.
- Separable_permutation type Abstraction100002137.
- Separable_permutation type Change107296428.
- Separable_permutation type Event100029378.
- Separable_permutation type Happening107283608.
- Separable_permutation type Permutations.
- Separable_permutation type PsychologicalFeature100023100.
- Separable_permutation type Substitution107443761.
- Separable_permutation type Variation107337390.
- Separable_permutation type YagoPermanentlyLocatedEntity.
- Separable_permutation comment "In combinatorial mathematics, a separable permutation is a permutation that can be obtained from the trivial permutation 1 by direct sums and skew sums. Separable permutations may be characterized by the forbidden permutation patterns 2413 and 3142; they are also the permutations whose permutation graphs are cographs and the permutations that realize the series-parallel partial orders.".
- Separable_permutation label "Separable Permutation".
- Separable_permutation label "Separable permutation".
- Separable_permutation sameAs Separable_Permutation.
- Separable_permutation sameAs m.07sb6z1.
- Separable_permutation sameAs Q7451767.
- Separable_permutation sameAs Q7451767.
- Separable_permutation sameAs Separable_permutation.
- Separable_permutation wasDerivedFrom Separable_permutation?oldid=587721891.
- Separable_permutation depiction Separable_Permutation_qtl1.svg.
- Separable_permutation isPrimaryTopicOf Separable_permutation.
