Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Partial_permutation> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Partial_permutation abstract "In combinatorial mathematics, a partial permutation on a finite set Sis a bijection between two specified subsets of S. That is, it is defined by two subsets U and V of equal size, and a one-to-one mapping from U to V. Equivalently, it is a partial function on S that can be extended to a permutation.It is common to consider the case when the set S is simply the set {1, 2, ..., n} of the first n integers. In this case, a partial permutation may be represented by a string of n symbols, some of which are distinct numbers in the range from 1 to and the remaining ones of which are a special "hole" symbol ◊. In this formulation, the domain U of the partial permutation consists of the positions in the string that do not contain a hole, and each such position is mapped to the number in that position. For instance, the string "1 ◊ 2" would represent the partial permutation that maps 1 to itself and maps 3 to 2.Some authors restrict partial permutations so that either the domain or the range of the bijection is forced to consist of the first k items in the set of n items being permuted, for some k. In the former case, a partial permutation of length k from an n-set is just a sequence of k terms from the n-set without repetition. (In elementary combinatorics, these objects are sometimes confusingly called "k-permutations" of the n-set.)".
- Partial_permutation wikiPageID "27499693".
- Partial_permutation wikiPageRevisionID "521360270".
- Partial_permutation hasPhotoCollection Partial_permutation.
- Partial_permutation subject Category:Combinatorics.
- Partial_permutation subject Category:Functions_and_mappings.
- Partial_permutation type Abstraction100002137.
- Partial_permutation type Function113783816.
- Partial_permutation type FunctionsAndMappings.
- Partial_permutation type MathematicalRelation113783581.
- Partial_permutation type Relation100031921.
- Partial_permutation comment "In combinatorial mathematics, a partial permutation on a finite set Sis a bijection between two specified subsets of S. That is, it is defined by two subsets U and V of equal size, and a one-to-one mapping from U to V. Equivalently, it is a partial function on S that can be extended to a permutation.It is common to consider the case when the set S is simply the set {1, 2, ..., n} of the first n integers.".
- Partial_permutation label "Arrangement".
- Partial_permutation label "Disposizione".
- Partial_permutation label "Partial permutation".
- Partial_permutation label "Permutação parcial".
- Partial_permutation label "Variatie (wiskunde)".
- Partial_permutation label "Variation (Kombinatorik)".
- Partial_permutation label "Размещение".
- Partial_permutation label "順列".
- Partial_permutation sameAs Variace_(kombinatorika).
- Partial_permutation sameAs Variation_(Kombinatorik).
- Partial_permutation sameAs Aldakuntza_(konbinatoria).
- Partial_permutation sameAs Arrangement.
- Partial_permutation sameAs Kombinasi_dan_permutasi.
- Partial_permutation sameAs Disposizione.
- Partial_permutation sameAs 順列.
- Partial_permutation sameAs Variatie_(wiskunde).
- Partial_permutation sameAs Permutação_parcial.
- Partial_permutation sameAs m.0c02g0j.
- Partial_permutation sameAs Q1401935.
- Partial_permutation sameAs Q1401935.
- Partial_permutation sameAs Partial_permutation.
- Partial_permutation wasDerivedFrom Partial_permutation?oldid=521360270.
- Partial_permutation isPrimaryTopicOf Partial_permutation.