2 papers
math.PR2025
Heights of butterfly trees
John Peca-Medlin, Chenyang Zhong
Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding inter…
math.PR2024
On the longest increasing subsequence and number of cycles of butterfly permutations
John Peca-Medlin, Chenyang Zhong
One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix and storing the permutation matrix factor fro…