2 papers
math.CO2026
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.CO2024
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.