permutation_matrix.py

import numpy as np

def create_n_depth_matrix(n: int) -> np.array:
    """Function used to generate all binary permutations of length n.
    
    Binary permutations of n=3 for example would include:
    [0,0,0],[0,0,1],[0,1,0],[0,1,1],[1,0,0],[1,0,1],[1,1,0],[1,1,1]
    Binary permuataions are  arranged in a 3d matrix of shape (n, a, b)
    such that a*b == (2^n)
    
    Args:
      n (int): depth of a column
    Returns:
      np.array: a (2^n) X (n) matrix.
    """  
    assert n > 2
    d = n 
    layers = []
    last_layer = np.tile(np.array([0,1]),2**(d-1))
    for x in range(d-1):
        layers.append(last_layer.copy())
        last_layer = np.repeat(last_layer, 2)[:2**d]
    layers.append(last_layer) 
    return np.stack(layers).T.reshape(2**(d//2), 2**(d- (d//2)),d)