Explore relationships

Separable permutation

In combinatorial mathematics, a separable permutation is a permutation that can be obtained from the trivial permutation 1 by direct sums and skew sums.

Use + to expand a branch. Click a topic name to open its summary.