gaussian elimination with partial pivoting (gepp) remains the most used dense linear solver. for a n x n matrix a, gepp results in the factorization pa = lu where l and u are lower and upper triangular matrices and p is a permutation matrix. if a is a random matrix, then the associated permutation from the p factor is random. when is this a uniform permutation? how many cycles are in its disjoint cycle decomposition (which equivalently answers how many gepp pivot movements are needed on a)? what is the length of the longest increasing subsequence of this permutation? we will provide some statistical answers to these questions for select random matrix ensembles and transformations. for particular butterfly permutations, we will present full distributional descriptions for these particular statistics. moreover, we introduce a random butterfly matrix ensemble that induces the haar measure on a full 2-sylow subgroup of the symmetric group on a set of size 2ⁿ.