User Portlet
Discussions |
---|
Reddit provided me with this: (* Consider a list of n elements Sn (some permutation of 1..n) and a list of k elements pk (some permutation of 1..k) with k = Length[pk] := Count[SubsetsInversePermsAnyOrderedQ[#, pk] & /@ Permutations@Range@n, ... |