Smirnov Trees
Combinatorics
2019-01-30 v1
Abstract
We introduce a generalization of Smirnov words in the context of labeled binary trees, which we call Smirnov trees. We study the generating function for ascent-descent statistics on Smirnov trees and establish that it is -positive, which is akin to the classical case of Smirnov words. Our proof relies on an intricate weight-preserving bijection.
Keywords
Cite
@article{arxiv.1901.10140,
title = {Smirnov Trees},
author = {Matjaž Konvalinka and Vasu Tewari},
journal= {arXiv preprint arXiv:1901.10140},
year = {2019}
}
Comments
23 pages