Revision history [back]

Is it possible to get faster running if one applies a kind of multiprocessing to the example below?

L = Permutations(10)
K = factorial(10)
C = matrix(ZZ, 0, N)
d = []
for k in range(1, 10):
    B = Arrangements([1 .. 10], k)
    A = matrix(ZZ, [[all(p[i - 1] == u for i, u in zip(ii, uu))
                     for p in L] for ii in B for uu in B])
    C = C.stack(A)
    d.append(N-C.rank())
return d

Is it possible to get faster running if one applies a kind of multiprocessing to the example below?

L = Permutations(10)
K = factorial(10)
C = matrix(ZZ, 0, N)
K)
d = []
for k in range(1, 10):
    B = Arrangements([1 .. 10], k)
    A = matrix(ZZ, [[all(p[i - 1] == u for i, u in zip(ii, uu))
                     for p in L] for ii in B for uu in B])
    C = C.stack(A)
    d.append(N-C.rank())
return d