one method to generate random permutations involves using gaussian elimination with partial pivoting (gepp) on a random matrix a and storing the permutation matrix factor p from the resulting gepp factorization pa=lu. we are interested in exploring properties of random butterfly permutations, which are generated using gepp on specific random butterfly matrices. we address the questions of the longest increasing subsequence (lis) and number of cycles for particular uniform butterfly permutations, with full distributional descriptions and limit theorems for simple butterfly permutations. we also establish scaling limit results and limit theorems for nonsimple butterfly permutations, which include certain p-sylow subgroups of the symmetric group of n=pⁿ elements. for the lis, we establish power-law bounds on the first moment n^αₚ ≤ e(lis) ≤ n^βₚ where 1/2 < αₚ < βₚ < 1 and αₚ = 1 - oₚ(1), showing distinction from the typical o(n¹ᐟ²) expected lis frequently encountered in the study of random permutations (e.g., uniform permutations, colored permutations, recent wreath product permutations studied by diaconis). for the number of cycles scaled by (2-1/p)ⁿ, we establish a full clt to a new limiting distribution depending on p with positive support we introduce that is uniquely determined by its positive moments that satisfy explicit recursive formulas; this thus determines a number of cycles clt for any uniform p-sylow subgroups of sₚn. this work is joint with chenyang zhong, and continues from a ucsd probability seminar talk i gave last may to now include novel results and proof techniques from our recent preprint arxiv:2410.20952.