Weak Order of Permutations
Versandfertig in 6-10 Tagen
26,99 €
inkl. MwSt.
PAYBACK Punkte
13 °P sammeln!
High Quality Content by WIKIPEDIA articles! In mathematics, the set of permutations on n items can be given the structure of a partial order, called the weak order of permutations. The weak order of permutations forms a lattice. To define this order, consider the items being permuted to be the integers from 1 to n, and let Inv(u) denote the set of inversions of a permutation u for the natural ordering on these items. That is, Inv(u) is the set of ordered pairs (i, j) such that 1 i u(j). Then, in the weak order, we define u v whenever Inv(u) Inv(v). The edges of the Hasse diagram of the weak or...
High Quality Content by WIKIPEDIA articles! In mathematics, the set of permutations on n items can be given the structure of a partial order, called the weak order of permutations. The weak order of permutations forms a lattice. To define this order, consider the items being permuted to be the integers from 1 to n, and let Inv(u) denote the set of inversions of a permutation u for the natural ordering on these items. That is, Inv(u) is the set of ordered pairs (i, j) such that 1 i u(j). Then, in the weak order, we define u v whenever Inv(u) Inv(v). The edges of the Hasse diagram of the weak order are given by permutations u and v such that u v and such that v is obtained from u by interchanging two consecutive values of u. These edges form a Cayley graph for the group of permutations that is isomorphic to the skeleton of a permutohedron.
