-
Anglický jazyk
Parity of a Permutation
Autor: Lambert M. Surhone
High Quality Content by WIKIPEDIA articles! In mathematics, when X is a finite set of at least two elements, the permutations of X (i.e. the bijective mappings from X to X) fall into two classes of equal size: the even permutations and the odd permutations.... Viac o knihe
Na objednávku
132.91 €
bežná cena: 139.90 €
O knihe
High Quality Content by WIKIPEDIA articles! In mathematics, when X is a finite set of at least two elements, the permutations of X (i.e. the bijective mappings from X to X) fall into two classes of equal size: the even permutations and the odd permutations. If any total ordering of X is fixed, the parity (oddness or evenness) of a permutation s of X can be defined as the parity of the number of inversions for s, i.e., of pairs of elements x,y of X such that x y and s(x) s(y). The sign or signature of a permutation s is denoted sgn(s) and defined as +1 if s is even and -1 if s is odd. The signature defines the alternating character of the symmetric group Sn. Another notation for the sign of a permutation is given by the more general Levi-Civita symbol (es), which is defined for all maps from X to X, and has value zero for non-bijective maps.
- Vydavateľstvo: OmniScriptum
- Rok vydania: 2026
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786130335649
