Metraipolis › archive › dc_dc902ce92b2f

Permutation — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Permutation
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T17:38:17.814Z
SHA-256 of the archived text
8b2d8cd473c05c9feebbc080ebad69f68b6fc2586e6fd0db94b98d7d82c91920
Stable URL of this page
https://metraipolis.com/documento/dc_dc902ce92b2f

How to cite

Permutation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Permutation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_dc902ce92b2f (Metraipolis archive dc_dc902ce92b2f, sha256 8b2d8cd473c05c9feebbc080ebad69f68b6fc2586e6fd0db94b98d7d82c91920)
BibTeX
@misc{dcdc902ce92b2f,
  title = {Permutation — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Permutation},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_dc902ce92b2f; sha256 8b2d8cd473c05c9feebbc080ebad69f68b6fc2586e6fd0db94b98d7d82c91920},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Permutation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, a permutation is a bijection of a set onto itself. It can be interpreted as a new order of the members of a sequence or linear order, or as the act or process of changing the linear order of an ordered set. An example of the first interpretation is the six permutations of the set {1, 2, 3}, which are the six 3-tuples (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). They correspond to the six bijections that map 1, 2, 3, to the first, the second and the third member of the tuple, respectively. Anagrams of a word whose letters are all different are also permutations: the letters are already ordered in the original word, and the anagram reorders them. The study of permutations of finite sets is an important topic in combinatorics and group theory. Permutations are used in almost every branch of mathematics and in many other fields of science. In computer science, they are used for analyzing sorting algorithms; in quantum physics, for describing states of particles; and in biology, for describing RNA sequences. The number of permutations of n distinct objects is n factorial, usually written as n!, which means the product of all positive integers less than or equal to n. According to the second meaning, a permutation of a set S is defined as a bijection from S to itself. That is, it is a function from S to S for which every element occurs exactly once as an image value. Such a function σ : S → S {\displaystyle \sigma :S\to S} is equivalent to the rearrangement of the elements of S in which each element i is replaced by the corresponding σ ( i ) {\displaystyle \sigma (i)} . For example, the permutation (3, 1, 2) corresponds to the function σ {\displaystyle \sigma } defined as σ ( 1 ) = 3 , σ ( 2 ) = 1 , σ ( 3 ) = 2. {\displaystyle \sigma (1)=3,\quad \sigma (2)=1,\quad \sigma (3)=2.} The collection of all permutations of a set form a group called the symmetric group of the set. The group operation is the composition of functions (performing one rearrangement after the other), which results in another function (rearrangement). In elementary combinatorics, the k-permutations, or partial permutations, are the ordered arrangements of k distinct elements selected from a set. When k is equal to the size of the set, these are the permutations in the previous sense.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»).
Fonte: Wikipedia in inglese, voce «Permutation» — https://en.wikipedia.org/wiki/Permutation
Wikidata Q161519 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q161519
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Permutation?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377687761, consultata il 2026-10-07T17:08:28.106Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c1431fa375973c03db259b2b4223990f43ec9f92b265a8d27ac0922ffd4542dd