Miklós Bóna

activity

19972025

most cited2-stack sortable permutations with a given number of runs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 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

$k$ -protected vertices in binary search trees

Miklos Bona

We show that for every $k$ , the probability that a randomly selected vertex of a random binary search tree on $n$ nodes is at distance $k - 1$ from the closest leaf converges to a ra…

math.CO1997★ 1 cited

2-stack sortable permutations with a given number of runs

Miklós Bóna

Using earlier results we prove a formula for the number $W_{(n, k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k - 1$ descents. This formula wi…

Stack-sorting preimages and 0-1-trees

Long increasing subsequences and non-algebraicity

k-protected vertices in binary search trees

2-stack sortable permutations with a given number of runs

$k$ -protected vertices in binary search trees