Алгебра : Теоремы и алгоритмы. Яцкин Н.И. - 190 стр.

UptoLike

Составители: 

190 Теория перестановок Гл. 3
S
2
:
ε; 1; 1;
(1, 2); 2; 1.
S
3
:
ε; 1; 1;
(2, 3); 2; 1;
(1, 2); 2; 1;
(1, 2, 3) = (1, 3) (1, 2); 3; 1;
(1, 3, 2) = (1, 2) (1, 3); 3; 1;
(1, 3); 2; 1.
S
4
:
ε; 1; 1;
(3, 4); 2; 1;
(2, 3); 2; 1;
(2, 3, 4) = (2, 4) (2, 3); 3; 1;
(2, 4, 3) = (2, 3) (2, 4); 3; 1;
(2, 4); 2; 1;
(1, 2); 2; 1;
(1, 2) (3, 4); 2; 1;
(1, 2, 3) = (1, 3) (1, 2); 3; 1;
(1, 2, 3, 4) = (1, 4) (1, 3) (1, 2); 4; 1;
(1, 2, 4, 3) = (1, 3) (1, 4) (1, 2); 4; 1;
(1, 2, 4) = (1, 4) (1, 2); 3; 1;
(1, 3, 2) = (1, 2) (1, 3); 3; 1;
(1, 3, 4, 2) = (1, 2) (1, 4) (1, 3); 4; 1;
(1, 3); 2; 1;
(1, 3, 4) = (1, 4) (1, 3); 3; 1;
(1, 3) (2, 4); 2; 1;
(1, 3, 2, 4) = (1, 4) (1, 2) (1, 3); 4; 1;
(1, 4, 3, 2) = (1, 2) (1, 3) (1, 4); 4; 1;
(1, 4, 2) = (1, 2) (1, 4); 3; 1;
(1, 4, 3) = (1, 3) (1, 4); 3; 1;
(1, 4); 2; 1;
(1, 4, 2, 3) = (1, 3) (1, 2) (1, 4); 4; 1;
(1, 4) (2, 3); 2; 1.
190                        Теория перестановок    Гл. 3

  S2 :
  ε; 1; 1;
  (1, 2); 2; −1.

  S3 :
  ε; 1; 1;
  (2, 3); 2; −1;
  (1, 2); 2; −1;
  (1, 2, 3) = (1, 3) (1, 2); 3; 1;
  (1, 3, 2) = (1, 2) (1, 3); 3; 1;
  (1, 3); 2; −1.

  S4 :
  ε; 1; 1;
  (3, 4); 2; −1;
  (2, 3); 2; −1;
  (2, 3, 4) = (2, 4) (2, 3); 3; 1;
  (2, 4, 3) = (2, 3) (2, 4); 3; 1;
  (2, 4); 2; −1;
  (1, 2); 2; −1;
  (1, 2) (3, 4); 2; 1;
  (1, 2, 3) = (1, 3) (1, 2); 3; 1;
  (1, 2, 3, 4) = (1, 4) (1, 3) (1, 2);   4; −1;
  (1, 2, 4, 3) = (1, 3) (1, 4) (1, 2);   4; −1;
  (1, 2, 4) = (1, 4) (1, 2); 3; 1;
  (1, 3, 2) = (1, 2) (1, 3); 3; 1;
  (1, 3, 4, 2) = (1, 2) (1, 4) (1, 3);   4; −1;
  (1, 3); 2; −1;
  (1, 3, 4) = (1, 4) (1, 3); 3; 1;
  (1, 3) (2, 4); 2; 1;
  (1, 3, 2, 4) = (1, 4) (1, 2) (1, 3);   4; −1;
  (1, 4, 3, 2) = (1, 2) (1, 3) (1, 4);   4; −1;
  (1, 4, 2) = (1, 2) (1, 4); 3; 1;
  (1, 4, 3) = (1, 3) (1, 4); 3; 1;
  (1, 4); 2; −1;
  (1, 4, 2, 3) = (1, 3) (1, 2) (1, 4);   4; −1;
  (1, 4) (2, 3); 2; 1.