3 papers
math.CO2025
Stack-sorting preimages and 0-1-trees
Miklos Bona
We define a class of partially labeled trees and use them to find simple proofs for two recent enumeration results of Colin Defant concerning stack-sorting preimages of permutation…
math.CO2023
Long increasing subsequences and non-algebraicity
Miklos Bona
We use a recent result of Alin Bostan to prove that the generating functions of two infinite sequences of permutation classes are not algebraic.
math.CO2013
-protected vertices in binary search trees
Miklos Bona
We show that for every , the probability that a randomly selected vertex of a random binary search tree on nodes is at distance from the closest leaf converges to a ra…