In combinatorics, the skew sum and direct sum of permutations are two operations to combine shorter permutations into longer ones. Given a permutation π of length m and the permutation σ of length n, the skew sum of π and σ is the permutation of length m + n defined by
( π ⊖ σ ) ( i ) = { π ( i ) + n for 1 ≤ i ≤ m , σ ( i − m ) for m + 1 ≤ i ≤ m + n , {\displaystyle (\pi \ominus \sigma )(i)={\begin{cases}\pi (i)+n&{\text{for }}1\leq i\leq m,\\\sigma (i-m)&{\text{for }}m+1\leq i\leq m+n,\end{cases}}}
and the direct sum of π and σ is the permutation of length m + n defined by
( π ⊕ σ ) ( i ) = { π ( i ) for 1 ≤ i ≤ m , σ ( i − m ) + m for m + 1 ≤ i ≤ m + n . {\displaystyle (\pi \oplus \sigma )(i)={\begin{cases}\pi (i)&{\text{for }}1\leq i\leq m,\\\sigma (i-m)+m&{\text{for }}m+1\leq i\leq m+n.\end{cases}}}
Examples The skew sum of the permutations π = 2413 and σ = 35142 is 796835142 (the last five entries are equal to σ, while the first four entries come from shifting the entries of π) while their direct sum is 241379586 (the first four entries are equal to π, while the last five come from shifting the entries of σ).
Sums of permutations as matrices If Mπ and Mσ are the permutation matrices corresponding to π and σ, respectively, then the permutation matrix M π ⊖ σ {\displaystyle M_{\pi \ominus \sigma }} corresponding to the skew sum π ⊖ σ {\displaystyle \pi \ominus \sigma } is given by
M π ⊖ σ = [ 0 M π M σ 0 ] {\displaystyle M_{\pi \ominus \sigma }={\begin{bmatrix}0&M_{\pi }\\M_{\sigma }&0\end{bmatrix}}} , and the permutation matrix M π ⊕ σ {\displaystyle M_{\pi \oplus \sigma }} corresponding to the direct sum π ⊕ σ {\displaystyle \pi \oplus \sigma } is given by
M π ⊕ σ = [ M π 0 0 M σ ] {\displaystyle M_{\pi \oplus \sigma }={\begin{bmatrix}M_{\pi }&0\\0&M_{\sigma }\end{bmatrix}}} , where here the symbol "0" is used to represent rectangular blocks of zero entries. Following the example of the preceding section, we have (suppressing all 0 entries) that
… excerpt ends here. Continue reading the full article.
